Regularity properties for triple systems

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

Brendan Nagle, Vojtěch Rödl

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 lemmahypergraph regularity lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items

On characterizing hypergraph regularity, Integer and fractional packings in dense 3‐uniform hypergraphs, Regularity Lemma for k-uniform hypergraphs, Counting in hypergraphs via regularity inheritance, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, Constructive Packings of Triple Systems, Some Cubic Time Regularity Algorithms for Triple Systems, Sparse hypergraphs: new bounds and constructions, The hypergraph regularity method and its applications, Note on the 3-graph counting Lemma, 3-uniform hypergraphs of bounded degree have linear Ramsey numbers, Counting subgraphs in quasi‐random 4‐uniform hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, A hypergraph blow-up lemma, Combinatorial Problems for Horn Clauses, A geometric theory for hypergraph matching, The co-degree density of the Fano plane, Complete Partite subgraphs in dense hypergraphs

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