The Turán problem for projective geometries

DOI10.1016/j.jcta.2004.12.007zbMath1070.05053OpenAlexW2114194662MaRDI QIDQ2566808

Peter Keevash

Publication date: 28 September 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.12.007

zbMATH Keywords

hypergraphprojective geometryFano plane

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (11)

Codegree problems for projective geometries ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ The group marriage problem. ⋮ Threshold for Steiner triple systems ⋮ New lower bounds for the Turán density of \(PG_m(q)\) ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes ⋮ Simplex Stability ⋮ Generalising Fisher's inequality to coverings and packings ⋮ A hypergraph regularity method for generalized Turán problems ⋮ On the Codegree Density of $PG_m(q)$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• On the Turán number of triple systems
• The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
• Bounds on the Turán density of PG(3, 2)
• The Turán number of the Fano plane
• On a hypergraph Turán problem of Frankl
• Turán problems for integer-weighted graphs
• 5‐chromatic steiner triple systems
• Triple Systems Not Containing a Fano Configuration

This page was built for publication: The Turán problem for projective geometries