Regularity properties for triple systems

DOI10.1002/rsa.10094zbMath1026.05061MaRDI QIDQ4431435

Vojtěch Rödl, Brendan Nagle

Publication date: 22 October 2003

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10094

zbMATH Keywords

Szemerédi's regularity lemma; hypergraph regularity lemma

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C65: Hypergraphs

Related Items

Counting subgraphs in quasi‐random 4‐uniform hypergraphs, On characterizing hypergraph regularity, Integer and fractional packings in dense 3‐uniform hypergraphs, Regularity Lemma for k-uniform hypergraphs, The hypergraph regularity method and its applications, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, Note on the 3-graph counting Lemma, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, The co-degree density of the Fano plane, A hypergraph blow-up lemma, Complete Partite subgraphs in dense hypergraphs, Combinatorial Problems for Horn Clauses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• Extremal problems on set systems
• Counting Small Cliques in 3-uniform Hypergraphs
• Hereditary Properties of Triple Systems
• Integer and fractional packings in dense 3‐uniform hypergraphs
• The asymptotic number of triple systems not containing a fixed one