Almost all triangle-free triple systems are tripartite

DOI10.1007/S00493-012-2657-4zbMath1262.05109OpenAlexW2060185368MaRDI QIDQ452822

József Balogh, Dhruv Mubayi

Publication date: 17 September 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-012-2657-4

zbMATH Keywords

3-hypergraphs3-partite 3-graphsforbidden 3-graphhypergraph regularity lemmastability theorem of triangle-free triple systems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Asymptotic enumeration (05A16)

Related Items (12)

Counting \(r\)-graphs without forbidden configurations ⋮ Random ℓ‐colourable structures with a pregeometry ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ The structure of almost all graphs in a hereditary property ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the structure of oriented graphs and digraphs with forbidden tournaments or cycles ⋮ The typical structure of sparse $K_{r+1}$-free graphs ⋮ DISCRETE METRIC SPACES: STRUCTURE, ENUMERATION, AND 0-1 LAWS ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Independent sets in hypergraphs

Cites Work

• Unnamed Item
• The fine structure of octahedron-free graphs
• Weak hypergraph regularity and linear hypergraphs
• Hereditary properties of hypergraphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The asymptotic number of graphs not containing a fixed color-critical subgraph
• Three-graphs without two triples whose symmetric difference is contained in a third
• The number of graphs without forbidden subgraphs
• Stability theorems for cancellative hypergraphs
• The Turán number of the Fano plane
• Almost all triple systems with independent neighborhoods are semi-bipartite
• Excluding induced subgraphs: Critical graphs
• The typical structure of graphs without given excluded subgraphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Extremal problems on set systems
• Projections of Bodies and Hereditary Properties of Hypergraphs
• The number of K _s,t -free graphs
• Triple Systems Not Containing a Fano Configuration
• A new generalization of the Erdős-Ko-Rado theorem
• The asymptotic number of triple systems not containing a fixed one

This page was built for publication: Almost all triangle-free triple systems are tripartite