An Algorithmic Version of the Hypergraph Regularity Method

DOI10.1137/060652385zbMath1152.05048OpenAlexW2044011276MaRDI QIDQ3549322

Penny E. Haxell, Vojtěch Rödl, Brendan Nagle

Publication date: 22 December 2008

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

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

zbMATH Keywords

algorithmic regularity Lemma for hypergraphscounting Lemma for hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorics in computer science (68R05) Extremal set theory (05D05)

Related Items (5)

Integer and fractional packings of hypergraphs ⋮ Constructive Packings of Triple Systems ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ Constructive Packings by Linear Hypergraphs ⋮ Hereditary properties of hypergraphs

This page was built for publication: An Algorithmic Version of the Hypergraph Regularity Method