The maximum size of 3-uniform hypergraphs not containing a Fano plane
From MaRDI portal
Publication:1569074
DOI10.1006/jctb.1999.1938zbMath1027.05073OpenAlexW2076011470WikidataQ56850758 ScholiaQ56850758MaRDI QIDQ1569074
Dominique De Caen, Zoltan Fueredi
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e046e41c52fd6137cf8debc32253068754d4909e
Related Items
The Turán Number ofF3,3, Stability theorems for cancellative hypergraphs, Codegree problems for projective geometries, Co-degree density of hypergraphs, Combinatorial theorems in sparse random sets, The Codegree Threshold for 3-Graphs with Independent Neighborhoods, On the size of 3-uniform linear hypergraphs, Hypergraph Turán densities can have arbitrarily large algebraic degree, Extremal problems in uniformly dense hypergraphs, \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles, On Turán numbers for disconnected hypergraphs, A 2-stable family of triple systems, On the Turán density of uniform hypergraphs, On the Chromatic Thresholds of Hypergraphs, New lower bounds for the Turán density of \(PG_m(q)\), Stability theorems for some Kruskal-Katona type results, On the co-degree threshold for the Fano plane, On possible Turán densities, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Counting substructures. II: Hypergraphs, Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\), Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs, Unnamed Item, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree, Flag algebras, A hypergraph regularity method for generalized Turán problems, Forbidden configurations: boundary cases, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, The Turán problem for projective geometries, The co-degree density of the Fano plane, A hypergraph Turán problem with no stability, A hypergraph extension of Turán's theorem, A unified approach to hypergraph stability, On the Turán number of triple systems, Turán problems for integer-weighted graphs
Cites Work
