Regularity properties for triple systems

DOI10.1002/RSA.10094MaRDI QIDQ4431435zbMATH OpenOpenAlexFDO

Authors B. 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

hypergraph regularity lemmaSzemerédi's regularity lemma

Mathematics Subject Classification ID

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

Recommendations

• An Algorithmic Version of the Hypergraph Regularity Method
• Note on the 3-graph counting Lemma
• Regularity Lemma for k-uniform hypergraphs
• The counting lemma for regular k‐uniform hypergraphs
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

Cites work

• Counting Small Cliques in 3-uniform Hypergraphs
• Extremal problems on set systems
• Hereditary Properties of Triple Systems
• scientific article; zbMATH DE number 3523693 (Why is no real title available?)
• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 878896 (Why is no real title available?)
• Integer and fractional packings in dense 3‐uniform hypergraphs
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The asymptotic number of triple systems not containing a fixed one

Cited in

(26)

• Sparse hypergraphs: new bounds and constructions
• Regular \(t\)-bonded systems in \(\mathbb{R}^3\)
• 3-uniform hypergraphs of bounded degree have linear Ramsey numbers
• The co-degree density of the Fano plane
• scientific article; zbMATH DE number 5910715 (Why is no real title available?)
• A hypergraph blow-up lemma
• Complete partite subgraphs in dense hypergraphs
• Counting in hypergraphs via regularity inheritance
• Combinatorial Problems for Horn Clauses
• scientific article; zbMATH DE number 94985 (Why is no real title available?)
• Constructive Packings of Triple Systems
• Counting subgraphs in quasi‐random 4‐uniform hypergraphs
• Short paths in 3-uniform quasi-random hypergraphs
• Counting Small Cliques in 3-uniform Hypergraphs
• Extremal problems for triple systems
• 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
• Regular Partitions of Hypergraphs: Counting Lemmas
• A geometric theory for hypergraph matching
• Some Cubic Time Regularity Algorithms for Triple Systems
• Equivalent regular partitions of three-uniform hypergraphs
• 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

This page was built for publication: Regularity properties for triple systems

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