The Codegree Threshold for 3-Graphs with Independent Neighborhoods

DOI10.1137/130926997zbMath1320.05135arXiv1307.0075OpenAlexW1919563699MaRDI QIDQ2944457

Emil R. Vaughan, Edward Marchant, Oleg Pikhurko, Victor Falgas-Ravry

Publication date: 2 September 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

3-graphsTurán densityTurán functioncodegree

Mathematics Subject Classification ID

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

Related Items (14)

Codegree Turán Density of Complete $r$-Uniform Hypergraphs ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ On the codegree density of complete 3-graphs and related problems ⋮ 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 ⋮ Semidefinite Programming and Ramsey Numbers ⋮ Decomposing Graphs into Edges and Triangles ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Minimum number of edges that occur in odd cycles ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths ⋮ On the Codegree Density of $PG_m(q)$

Uses Software

• Flagmatic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the codegree density of complete 3-graphs and related problems
• New Turán densities for 3-graphs
• Hypergraphs with independent neighborhoods
• Supersaturated graphs and hypergraphs
• Generalizations of the removal lemma
• Three-graphs without two triples whose symmetric difference is contained in a third
• On hypergraphs with every four points spanning at most two triples
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• The codegree threshold of \(K_4^-\)
• The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
• The Turán number of the Fano plane
• Codegree problems for projective geometries
• On the co-degree threshold for the Fano plane
• The Turán problem for projective geometries
• On the number of Latin squares
• The co-degree density of the Fano plane
• Co-degree density of hypergraphs
• ${\ell}$-Degree Turán Density
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• A hypergraph regularity method for generalized Turán problems
• Oriented hamilton cycles in digraphs
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• The Inducibility of Graphs on Four Vertices
• Flag algebras
• Triple Systems Not Containing a Fano Configuration
• On Triple Systems with Independent Neighbourhoods
• On the structure of linear graphs

This page was built for publication: The Codegree Threshold for 3-Graphs with Independent Neighborhoods