Counting substructures. II: Hypergraphs
From MaRDI portal
Publication:485550
DOI10.1007/s00493-013-2638-2zbMath1313.05275arXiv0905.1963MaRDI QIDQ485550
Publication date: 9 January 2015
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.1963
05C65: Hypergraphs
05C30: Enumeration in graph theory
05D05: Extremal set theory
05A16: Asymptotic enumeration
05B07: Triple systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a theorem of Rademacher-Turán
- A variant of the hypergraph removal lemma
- A new generalization of Mantel's theorem to \(k\)-graphs
- An exact Turán result for the generalized triangle
- Quadruple systems with independent neighborhoods
- Three-graphs without two triples whose symmetric difference is contained in a third
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- On the Turán number of triple systems
- Stability theorems for cancellative hypergraphs
- Counting substructures. I: Color critical graphs
- Asymptotic solution of a Turán-type problem
- The Turán number of the Fano plane
- On a hypergraph Turán problem of Frankl
- Hypergraph regularity and the multidimensional Szemerédi theorem
- 4-books of three pages
- A hypergraph extension of Turán's theorem
- The number of cliques in graphs of given order and size
- On the Minimal Density of Triangles in Graphs
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Triple Systems Not Containing a Fano Configuration
- On Triple Systems with Independent Neighbourhoods
- A new generalization of the Erdős-Ko-Rado theorem
