Almost all triangle-free triple systems are tripartite

DOI10.1007/S00493-012-2657-4zbMATH Open1262.05109OpenAlexW2060185368MaRDI QIDQ452822FDOQ452822

Authors: 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

Recommendations

• A stability theorem for matchings in tripartite 3-graphs
• Stability theorems for cancellative hypergraphs
• On the chromatic number of simple triangle-free triple systems
• The size of minimum 3-trees
• 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
• Ryser's conjecture for tripartite 3-graphs
• An Algorithmic Version of the Hypergraph Regularity Method
• Mantel's theorem for random hypergraphs
• Density conditions for triangles in multipartite graphs
• Many disjoint triangles in co-triangle-free graphs

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) Asymptotic enumeration (05A16) Hypergraphs (05C65)

Cites Work

• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Projections of Bodies and Hereditary Properties of Hypergraphs
• Weak hypergraph regularity and linear 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
• The number of graphs without forbidden subgraphs
• Title not available (Why is that?)
• The typical structure of graphs without given excluded subgraphs
• The number of \(K_{s,t}\)-free graphs
• The fine structure of octahedron-free graphs
• Extremal problems on set systems
• A new generalization of the Erdős-Ko-Rado theorem
• Three-graphs without two triples whose symmetric difference is contained in a third
• Stability theorems for cancellative hypergraphs
• The Turán number of the Fano plane
• Triple Systems Not Containing a Fano Configuration
• Hereditary properties of hypergraphs
• The asymptotic number of triple systems not containing a fixed one
• Almost all triple systems with independent neighborhoods are semi-bipartite
• Excluding induced subgraphs: critical graphs

Cited In (15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452822)