On the Turán number of triple systems
From MaRDI portal
Publication:1865386
DOI10.1006/JCTA.2002.3284zbMath1009.05074OpenAlexW2104509227MaRDI QIDQ1865386
Publication date: 26 March 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2002.3284
Related Items (23)
The Turán Number ofF3,3 ⋮ Stability theorems for cancellative hypergraphs ⋮ Co-degree density of hypergraphs ⋮ On Turán densities of small triple graphs ⋮ Uniform Turán density of cycles ⋮ On the Turán density of uniform hypergraphs ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ New lower bounds for the Turán density of \(PG_m(q)\) ⋮ On the co-degree threshold for the Fano plane ⋮ Hypergraphs with independent neighborhoods ⋮ Counting substructures. II: Hypergraphs ⋮ Constructions of non-principal families in extremal hypergraph theory ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ Quadruple systems with independent neighborhoods ⋮ On local Turán problems ⋮ 4-books of three pages ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ The Turán problem for projective geometries ⋮ On the Codegree Density of $PG_m(q)$ ⋮ The co-degree density of the Fano plane ⋮ A hypergraph extension of Turán's theorem ⋮ The Turán density of triple systems is not principal
Cites Work
- An exact result for 3-graphs
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Three-graphs without two triples whose symmetric difference is contained in a third
- An upper bound for the Turán number \(t_3(n,4)\)
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- A new generalization of the Erdős-Ko-Rado theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Turán number of triple systems
