Skip to search formSkip to main contentSkip to account menu

Szemerédi regularity lemma

Known as: Szemeredi's regularity lemma, Szemeredi's lemma, Szemeredi regularity lemma 
In mathematics, the Szemerédi regularity lemma states that every large enough graph can be divided into subsets of about the same size so that the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Alan M. FriezeAlgorithmic version for Szemerédi regularity partitionGraph (discrete mathematics)Graphon

Broader (1)

Information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
The Szemerédi Regularity Lemma
The Szemeredi Regularity Lemma is a deep result in graph theory which roughly states that large, dense graphs can be approximated… 
2014
2014
A tight lower bound for Szemerédi’s regularity lemma
We determine the order of the tower height for the partition size in a version of Szemerédi’s regularity lemma. This addresses a… 
2014
2014
Szemerédi's Regularity Lemma via Martingales
We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number… 
Highly Cited
2009
Highly Cited
2009
Anisotropic Huber-L1 Optical Flow
TV regularization is an L1 penalization of the flow gradient magnitudes, and due to the tendency of the L1 norm to favor sparse… 
Highly Cited
2007
Highly Cited
2007
Regular Partitions of Hypergraphs: Regularity Lemmas
Szemerédi's regularity lemma for graphs has proved to be a powerful tool with many subsequent applications. The objective of this… 
Highly Cited
2006
Highly Cited
2006
A duality between clause width and clause density for SAT
We consider the relationship between the complexities of k-SAT and those of SAT restricted to formulas of constant density. Let… 
2006
2006
Szémeredi's regularity lemma and its applications in combinatorics
Szemeredi’s regularity lemma is a deep result in graph theory with applications in many different areas of mathematics. The lemma… 
2003
2003
Wavelet frames for distributions; local and pointwise regularity
This paper deals with wavelet frames for a large class of distributions on euclidean n-space, including all compactly supported… 
Review
2000
Review
2000
The Regularity Lemma and Its Applications in Graph Theory
Szemeredi's Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be… 
Highly Cited
1997
Highly Cited
1997
Blow-up Lemma
Regular pairs behave like complete bipartite graphs from the point of view of bounded degree subgraphs. 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)