Codegree problems for projective geometries
From MaRDI portal
Publication:2384802
DOI10.1016/J.JCTB.2007.01.004zbMATH Open1126.05061OpenAlexW2102272303MaRDI QIDQ2384802FDOQ2384802
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On a hypergraph Turán problem of Frankl
- On extremal problems of graphs and generalized graphs
- A hypergraph extension of Turán's theorem
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- The Turán number of the Fano plane
- Triple Systems Not Containing a Fano Configuration
- The co-degree density of the Fano plane
- Co-degree density of hypergraphs
- A note on codegree problems for hypergraphs
- The Turán problem for projective geometries
- Title not available (Why is that?)
- Title not available (Why is that?)
- 5‐chromatic steiner triple systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- On the codegree density of \(\mathrm{PG}_m(q)\)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- The codegree threshold of \(K_4^-\)
- Codegree thresholds for covering 3-uniform hypergraphs
- On the co-degree threshold for the Fano plane
- 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
- Hypergraphs with independent neighborhoods
- The Turán problem for projective geometries
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)
