New Turán densities for 3-graphs
From MaRDI portal
Publication:426895
zbMath1244.05122arXiv1110.4287MaRDI QIDQ426895
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.4287
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (19)
A problem of Erdős and Sós on 3-graphs ⋮ Almost similar configurations ⋮ An Irrational Lagrangian Density of a Single Hypergraph ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ A hypergraph Turán theorem via Lagrangians of intersecting families ⋮ An exact Turán result for tripartite 3-graphs ⋮ Hypergraph Turán densities can have arbitrarily large algebraic degree ⋮ Lagrangian-perfect hypergraphs ⋮ The codegree threshold of \(K_4^-\) ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications ⋮ On possible Turán densities ⋮ Turán problems on non-uniform hypergraphs ⋮ On local Turán problems ⋮ Stability of the Potential Function ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ An irrational Turán density via hypergraph Lagrangian densities ⋮ On the algebraic and topological structure of the set of Turán densities
Uses Software
This page was built for publication: New Turán densities for 3-graphs
