Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
An Algorithmic Version of the Hypergraph Regularity Method
Penny Haxell
,
Brendan Nagle
,
V. Rödl
Type:
Article
Publication Date:
2005-11-15
Citations:
13
DOI:
https://doi.org/10.1109/sfcs.2005.17
Share
Similar Works
Action
Title
Year
Authors
+
An Algorithmic Version of the Hypergraph Regularity Method
2008
Penny Haxell
Brendan Nagle
V. Rödl
+
The hypergraph regularity method and its applications
2005
V. Rödl
Brendan Nagle
Jozef Skokan
Mathias Schacht
Yoshiharu Kohayakawa
+
A Tight Bound for Hypergraph Regularity II
2018
Guy Moshkovitz
A. Shapira
+
A Tight Bound for Hypergraph Regularity II
2018
Guy Moshkovitz
A. Shapira
+
A Tight Bound for Hypergraph Regularity I
2018
Guy Moshkovitz
A. Shapira
+
PDF
Chat
A Tight Bound for Hyperaph Regularity
2019
Guy Moshkovitz
A. Shapira
+
An Algorithmic Hypergraph Regularity Lemma
2015
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
An algorithmic hypergraph regularity lemma
2016
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
A Tight Bound for Hyperaph Regularity
2019
Guy Moshkovitz
A. Shapira
+
PDF
Chat
Growth of regular partitions 3: strong regularity and the vertex partition
2024
C. Terry
+
An algorithmic hypergraph regularity lemma
2017
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
PDF
Chat
Regular Partitions of Hypergraphs: Regularity Lemmas
2007
Vojtěch Rödl
Mathias Schacht
+
PDF
Chat
Growth of regular partitions 2: Weak regularity
2024
C. Terry
+
PDF
Chat
An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs
2024
Natan Rubin
+
The counting lemma for regular k-uniform hypergraphs
2006
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
PDF
Chat
Regular Partitions of Hypergraphs: Counting Lemmas
2007
Vojtěch Rödl
Mathias Schacht
+
PDF
Chat
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing
2016
Jacob Fox
János Pach
Andrew Suk
+
PDF
Chat
Counting substructures II: Hypergraphs
2013
Dhruv Mubayi
+
Regular Partitions of Hypergraphs
2007
RödlVojtěch
SchachtMathias
+
On regularity lemmas and their applications
2016
Jacob Fox
László Lovász
Yufei Zhao
Works That Cite This (11)
Action
Title
Year
Authors
+
Property Testing in Hypergraphs and the Removal Lemma (Extended Abstract)
2007
Mathias Schacht
+
Integer and fractional packings of hypergraphs
2006
V. Rödl
Mathias Schacht
Mark Siggers
Norihide Tokushige
+
Constructive Packings by Linear Hypergraphs
2013
Jill S. Dizona
Brendan Nagle
+
PDF
Chat
An improved bound for regular decompositions of 3-uniform hypergraphs of bounded VC2-dimension
2023
C. Terry
+
PDF
Chat
Approximate Hypergraph Partitioning and Applications
2010
Eldar Fischer
Arie Matsliah
A. Shapira
+
and his celebrated work
2012
Mihyun Kang
+
The counting lemma for regular k-uniform hypergraphs
2006
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
A Dirac-Type Theorem for 3-Uniform Hypergraphs
2006
Vojtěch Rödl
Andrzej Ruciński
Endre Szemerédi
+
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
2006
Daniela Kühn
Deryk Osthus
+
Hypergraph regularity and quasi-randomness
2009
Brendan Nagle
Annika Poerschke
Vojtěch Rödl
Mathias Schacht
Works Cited by This (49)
Action
Title
Year
Authors
+
PDF
Chat
On sets of integers containing k elements in arithmetic progression
1975
Endre Szemerédi
+
PDF
Chat
Additive Approximation for Edge-Deletion Problems
2005
Noga Alon
A. Shapira
Benny Sudakov
+
Szemeredi''s Regularity Lemma and its applications in graph theory
1995
János Komlós
Miklós Simonovits
+
Efficient Testing of Hypergraphs
2002
Yoshiharu Kohayakawa
Brendan Nagle
Vojtěch Rödl
+
The Regularity Lemma and Its Applications in Graph Theory
2002
János Komlós
Ali Shokoufandeh
Miklós Simonovits
Endre Szemerédi
+
Extremal Hypergraph Problems and the Regularity Method
2007
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
1997
Dorit Dor
Michael Tarsi
+
Dense expanders and pseudo-random bipartite graphs
1989
Andrew Thomason
+
Ramsey Properties of Random Hypergraphs
1998
Vojtěch Rödl
Andrzej Ruciński
+
An optimal algorithm for checking regularity: (extended abstract)
2002
Yoshiharu Kohayakawa
V. Rödl
Luboš Thoma