An Algorithmic Regularity Lemma for Hypergraphs

DOI10.1137/S0097539799351729zbMath0971.05084OpenAlexW2076452042WikidataQ125016588 ScholiaQ125016588MaRDI QIDQ4507384

Vojtěch Rödl, Andrzej Czygrinow

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

regularity lemmahypergraphsalgortihms

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics in computer science (68R05)

Related Items (9)

Regularity Lemma for k-uniform hypergraphs ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ The hypergraph regularity method and its applications ⋮ Constructive Packings by Linear Hypergraphs ⋮ Hypergraph Independent Sets ⋮ Partitioning problems in dense hypergraphs ⋮ Weak quasi-randomness for uniform hypergraphs ⋮ An expected polynomial time algorithm for coloring 2-colorable 3-graphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs

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