Unavoidable hypergraphs
From MaRDI portal
Publication:1984522
DOI10.1016/j.jctb.2021.06.010zbMath1473.05215arXiv2011.12944OpenAlexW4210255237MaRDI QIDQ1984522
Publication date: 16 September 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.12944
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- On the maximum number of edges in a hypergraph with given matching number
- On unavoidable graphs
- The Turán number of sparse spanning graphs
- On a theorem of Rademacher-Turán
- On finite set-systems whose every intersection is a kernel of a star
- Unavoidable stars in 3-graphs
- Forbidding just one intersection
- The maximum number of edges in a 3-graph not containing a given star
- Exact solution of some Turán-type problems
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Intersection theorems with geometric consequences
- Proof of the Erdős matching conjecture in a new range
- What we know and what we do not know about Turán numbers
- Bounds on pairs of families with restricted intersections
- Note on sunflowers
- The Erdős matching conjecture and concentration inequalities
- Frankl-Rödl-type theorems for codes and permutations
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection Theorems for Systems of Sets
- Forbidden vector‐valued intersections
- A Partition Property of Simplices in Euclidean Space
- Forbidden Intersections
- An extremal problem for 3-graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Coding for Sunflowers
- Improved bounds for the sunflower lemma
- On unavoidable hypergraphs
- Extremal Numbers for Odd Cycles
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On a problem of K. Zarankiewicz
- Universal and unavoidable graphs
This page was built for publication: Unavoidable hypergraphs