Codegree problems for projective geometries

DOI10.1016/J.JCTB.2007.01.004MaRDI QIDQ2384802zbMATH OpenOpenAlexFDO

Authors Yi Zhao, Peter Keevash

Publication date 10 October 2007

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

Full work available at URL https://doi.org/10.1016/j.jctb.2007.01.004

zbMATH Keywords

CodegreeExtremal problemsHypergraphsProjective geometries

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• On the codegree density of \(\mathrm{PG}_m(q)\)
• The Turán problem for projective geometries
• On the codegree density of complete 3-graphs and related problems
• New lower bounds for the Turán density of PG_m(q)
• On the co-degree threshold for the Fano plane

Cites work

• 5‐chromatic steiner triple systems
• A hypergraph extension of Turán's theorem
• A note on codegree problems for hypergraphs
• Co-degree density of hypergraphs
• scientific article; zbMATH DE number 4052438 (Why is no real title available?)
• scientific article; zbMATH DE number 4080277 (Why is no real title available?)
• scientific article; zbMATH DE number 1290170 (Why is no real title available?)
• scientific article; zbMATH DE number 1531052 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3344591 (Why is no real title available?)
• On a hypergraph Turán problem of Frankl
• On extremal problems of graphs and generalized graphs
• The co-degree density of the Fano plane
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• The Turán number of the Fano plane
• The Turán problem for projective geometries
• Triple Systems Not Containing a Fano Configuration

Cited in

(11)

• On the co-degree threshold for the Fano plane
• The Turán problem for projective geometries
• Codegree thresholds for covering 3-uniform hypergraphs
• The codegree threshold for 3-graphs with independent neighborhoods
• A hypergraph regularity method for generalized Turán problems
• Codegree Turán density of complete r-uniform hypergraphs
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• On the codegree density of \(\mathrm{PG}_m(q)\)
• Hypergraphs with independent neighborhoods
• Tight path, what is it (Ramsey-)good for? Absolutely (almost) nothing! (Extended abstract)
• Title not available (Why is no real title available?)

This page was built for publication: Codegree problems for projective geometries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384802)