Almost all triple systems with independent neighborhoods are semi-bipartite

DOI10.1016/j.jcta.2011.01.006zbMath1231.05188arXiv1002.1925OpenAlexW2153349536MaRDI QIDQ2431618

Dhruv Mubayi, József Balogh

Publication date: 15 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.1925

zbMATH Keywords

semi-bipartiteindependent neighborhoodsspeed of hypergraph property

Mathematics Subject Classification ID

Hypergraphs (05C65) Triple systems (05B07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (12)

THE TYPICAL STRUCTURE OF MAXIMAL TRIANGLE-FREE GRAPHS ⋮ Counting \(r\)-graphs without forbidden configurations ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ The structure of almost all graphs in a hereditary property ⋮ Structure and enumeration theorems for hereditary properties in finite relational languages ⋮ Almost all triangle-free triple systems are tripartite ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ 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
• Unnamed Item
• Almost all triangle-free triple systems are tripartite
• The fine structure of octahedron-free graphs
• The structure of almost all graphs in a hereditary property
• Hypergraphs with independent neighborhoods
• Quadruple systems with independent neighborhoods
• 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
• Three-graphs without two triples whose symmetric difference is contained in a third
• The number of graphs without forbidden subgraphs
• On the Turán number of triple systems
• 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
• On Triple Systems with Independent Neighbourhoods
• The asymptotic number of triple systems not containing a fixed one

This page was built for publication: Almost all triple systems with independent neighborhoods are semi-bipartite