Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
On the Regularity Method for Hypergraphs
Mathias Schacht
Type:
Article
Publication Date:
2004-01-01
Citations:
5
Share
Similar Works
Action
Title
Year
Authors
+
Extremal Hypergraph Problems and the Regularity Method
2007
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
A Hypergraph Regularity Method for Linear Hypergraphs
2009
Shoaib Amjad Khan
+
Extremal hypergraph theory and algorithmic regularity lemma for sparse graphs
2011
Hiệp Hàn
+
PDF
Chat
An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs
2025
Natan Rubin
+
On the regularity problem in Terwilliger graphs
2007
Alexander L. Gavrilyuk
A. A. Makhnëv
+
Graph Regularity Method
2023
+
PDF
Chat
Regular Partitions of Hypergraphs: Regularity Lemmas
2007
Vojtěch Rödl
Mathias Schacht
+
Regularity Lemmas for Graphs
2010
Vojtěch Rödl
Mathias Schacht
+
Szemerédi’s Regularity Lemma for Sparse Graphs
1997
Yoshiharu Kohayakawa
+
PDF
Chat
ON REGULARITY OF HYPERGRAPH SEQUENCES
1994
Jacek Pomykała
Janusz Pomykala
+
A hypergraph blow-up lemma
2010
Peter Keevash
+
A hypergraph blow-up lemma
2010
Peter Keevash
+
SOME PROBLEMS IN EXTREMAL GRAPH THEORY AVOIDING THE USE OF THE REGULARITY LEMMA
2009
Ian Levitt
+
An Algorithmic Regularity Lemma for Hypergraphs
2000
Andrzej Czygrinow
Vojtěch Rödl
+
On distance-regularity in graphs
1982
Paul M. Weichsel
+
An Optimal Medium-Strength Regularity Algorithm for 3-uniform Hypergraphs
2019
John Theado
+
PDF
Chat
On characterizing hypergraph regularity
2002
Yulia Dementieva
Penny Haxell
Brendan Nagle
V. Rödl
+
An efficient regularity concept for sparse graphs and matrices
2009
Amin Coja‐Oghlan
Colin Cooper
Alan Frieze
+
PDF
Chat
Bounds for graph regularity and removal lemmas
2012
David Conlon
Jacob Fox
+
Extremal Hypergraph Theory and Algorithmic Regularity Lemma for Sparse Graphs
2010
Rerum Naturalium
Mathematisch-Naturwissenschaftlichen Fakultät
Works That Cite This (5)
Action
Title
Year
Authors
+
PDF
Chat
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
2007
Oliver Cooley
Nikolaos Fountoulakis
Daniela Kühn
Deryk Osthus
+
PDF
Chat
A structural result for hypergraphs with many restricted edge colorings
2010
Hanno Lefmann
Yury Person
Mathias Schacht
+
The counting lemma for regular k-uniform hypergraphs
2006
Brendan Nagle
Vojtěch Rödl
Mathias Schacht
+
Quasi-Random Hypergraphs and Extremal Problems for Hypergraphs
2010
Mathematisch-Naturwissenschaftlichen Fakultät
+
Applications of the regularity lemma for uniform hypergraphs
2006
Vojtěch Rödl
Jozef Skokan
Works Cited by This (26)
Action
Title
Year
Authors
+
PDF
Chat
Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
1996
Vitaly Bergelson
A. Leibman
+
Szemeredi''s Regularity Lemma and its applications in graph theory
1995
János Komlós
Miklós Simonovits
+
Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions
1977
Harry Furstenberg
+
Ramsey Properties of Random Hypergraphs
1998
Vojtěch Rödl
Andrzej Ruciński
+
Applications of the regularity lemma for uniform hypergraphs
2006
Vojtěch Rödl
Jozef Skokan
+
Arithmetic Progressions in Sets with Small Sumsets
2006
József Solymosi
+
PDF
Chat
Regularity and positional games
1963
Alfred W. Hales
Robert I. Jewett
+
PDF
Chat
A structural generalization of the Ramsey theorem
1977
Jaroslav Nešetřil
Vojtěch Rödl
+
Generalized arithmetical progressions and sumsets
1994
Imre Z. Ruzsa
+
The Uniformity Lemma for hypergraphs
1992
Péter Frankl
V. Rödl