On the codegree density of complete 3-graphs and related problems

zbMath1295.05167arXiv1307.3395MaRDI QIDQ396955

Victor Falgas-Ravry

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.3395

zbMATH Keywords

codegree densityextremal hypergraph theory

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (8)

Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs ⋮ Codegree Turán Density of Complete $r$-Uniform Hypergraphs ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ Independence number of hypergraphs under degree conditions ⋮ The codegree threshold of \(K_4^-\) ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs

Cites Work

• An exact result for 3-graphs
• The codegree threshold of \(K_4^-\)
• What we know and what we do not know about Turán numbers
• On the co-degree threshold for the Fano plane
• The co-degree density of the Fano plane
• Co-degree density of hypergraphs
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• Daisies and Other Turán Problems
• A hypergraph regularity method for generalized Turán problems
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• On Triple Systems with Independent Neighbourhoods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the codegree density of complete 3-graphs and related problems