Turán \(H\)-densities for 3-graphs
From MaRDI portal
Publication:456381
zbMath1252.05074arXiv1201.4326MaRDI QIDQ456381
Emil R. Vaughan, Victor Falgas-Ravry
Publication date: 24 October 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.4326
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)
Related Items (9)
Paths of length three are \(K_{r+1}\)-Turán-good ⋮ A problem of Erdős and Sós on 3-graphs ⋮ Rainbow triangles in three-colored graphs ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ On the exact maximum induced density of almost all graphs and their inducibility ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ Minimum number of edges that occur in odd cycles
This page was built for publication: Turán \(H\)-densities for 3-graphs
