The minimum size of 3-graphs without a 4-set spanning no or exactly three edges

DOI10.1016/J.EJC.2011.03.006zbMath1229.05154OpenAlexW2099921939MaRDI QIDQ648971

Oleg Pikhurko

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.03.006

zbMATH Keywords

extremal functionstability resultextremal hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Distance in graphs (05C12)

Related Items (14)

Paths of length three are \(K_{r+1}\)-Turán-good ⋮ A problem of Erdős and Sós on 3-graphs ⋮ Mini-workshop: Hypergraph Turán problem. Abstracts from the mini-workshop held April 8--14, 2012. ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles ⋮ Turán, involution and shifting ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Minimum number of edges that occur in odd cycles ⋮ On Turán's \((3,4)\)-problem with forbidden subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A measure-theoretic approach to the theory of dense hypergraphs
• Supersaturated graphs and hypergraphs
• Limits of dense graph sequences
• A new generalization of Mantel's theorem to \(k\)-graphs
• An exact Turán result for the generalized triangle
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quadruple systems with independent neighborhoods
• Generalizations of the removal lemma
• A class of constructions for Turan's (3,4)-problem
• An upper bound for the Turán number \(t_3(n,4)\)
• Stability theorems for cancellative hypergraphs
• What we know and what we do not know about Turán numbers
• The Turán number of the Fano plane
• On a hypergraph Turán problem of Frankl
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• Flag algebras
• Triple Systems Not Containing a Fano Configuration

This page was built for publication: The minimum size of 3-graphs without a 4-set spanning no or exactly three edges