An Algorithmic Hypergraph Regularity Lemma

DOI10.1137/1.9781611974331.CH122MaRDI QIDQ4575706zbMATH OpenOpenAlexFDO

Authors B. Nagle, Vojtěch Rödl, M. Schacht

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch122

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An algorithmic hypergraph regularity lemma
• An Algorithmic Regularity Lemma for Hypergraphs
• An Algorithmic Version of the Hypergraph Regularity Method
• A tight bound for hypergraph regularity
• Regularity lemmas for hypergraphs and quasi-randomness
• On characterizing hypergraph regularity
• The hypergraph regularity method and its applications
• Regularity lemmas for graphs
• The Algorithmic Aspects of the Regularity Lemma

Cited in

(12)

• Regular slices for hypergraphs
• An Algorithmic Version of the Hypergraph Regularity Method
• The Algorithmic Aspects of Uncrowded Hypergraphs
• An Algorithmic Regularity Lemma for Hypergraphs
• An algorithmic hypergraph regularity lemma
• Constructive Packings of Triple Systems
• Hypergraph regularity and quasi-randomness
• On characterizing hypergraph regularity
• Regularity Lemmas and Combinatorial Algorithms
• A fast new algorithm for weak graph regularity
• Approximate hypergraph partitioning and applications
• Some Cubic Time Regularity Algorithms for Triple Systems

This page was built for publication: An Algorithmic Hypergraph Regularity Lemma

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