arXiv (All)
open access
Turán number of a matching and a Berge triangle
For a fixed graph $G$, an $r$-uniform hypergraph is said to contain a Berge-$G$ if there exists a bijection $f\colon E(G)\to E(\mathcal{H})$ for some subhypergraph $\mathcal{H}$ such that $e\subseteq f(e)$ for every $e\in E(G)$. Motivated by Alon and Frankl's study of Turán problems under bounded ma
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#971390
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#965978
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#924635
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#920403
- A Near-Optimal Linear Range for the Erdős Matching Conjecture#985218
Record · ID 1062960
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive