A Sparse Regular Approximation Lemma
نویسندگان
چکیده
We introduce a new variant of Szemerédi’s regularity lemma which we call the sparse regular approximation lemma (SRAL). The input to this lemma is a graph G of edge density p and parameters , δ, where we think of δ as a constant. The goal is to construct an -regular partition of G while having the freedom to add/remove up to δ|E(G)| edges. As we show here, this weaker variant of the regularity lemma already suffices for proving the graph removal lemma and the hypergraph regularity lemma, which are two of the main applications of the (standard) regularity lemma. This of course raises the following question: can one obtain quantitative bounds for SRAL that are significantly better than those associated with the regularity lemma? Our first result answers the above question affirmatively by proving an upper bound for SRAL given by a tower of height O(log 1/p). This allows us to reprove Fox’s upper bound for the graph removal lemma. Our second result is a matching lower bound for SRAL showing that a tower of height Ω(log 1/p) is unavoidable. We in fact prove a more general multicolored lower bound which is essential for proving lower bounds for the hypergraph regularity lemma.
منابع مشابه
Counting Small Cliques in 3-uniform Hypergraphs
Many applications of Szemerédi’s Regularity Lemma for graphs are based on the following counting result. If G is an s-partite graph with partition V (G) = ⋃s i=1 Vi, |Vi| = m for all i ∈ [s], and all pairs (Vi, Vj ), 1 i < j s, are -regular of density d, then G contains (1± f( ))d s 2 ms cliques Ks, provided < (d), where f( ) tends to 0 as tends to 0. Guided by the regularity lemma for 3-unifor...
متن کاملThe Regularity Lemma of Szemerédi for Sparse Graphs
In this note we present a new version of the well-known lemma of Szemerédi [17] concerning regular partitions of graphs. Our result deals with subgraphs of pseudo-random graphs, and hence may be used to partition sparse graphs that do no contain dense subgraphs.
متن کاملThe Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition
In a series of four papers we prove the following relaxation of the Loebl–Komlós–Sós Conjecture: For every α > 0 there exists a number k0 such that for every k > k0 every n-vertex graph G with at least ( 1 2 +α)n vertices of degree at least (1+α)k contains each tree T of order k as a subgraph. The method to prove our result follows a strategy similar to approaches that employ the Szemerédi regu...
متن کاملExtremal results in sparse pseudorandom graphs
Szemerédi’s regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi’s regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi’s regularity lemma us...
متن کاملThe Approximate Loebl–komlós–sós Conjecture and Embedding Trees in Sparse Graphs
Loebl, Komlós and Sós conjectured that every n-vertex graph G with at least n/2 vertices of degree at least k contains each tree T of order k + 1 as a subgraph. We give a sketch of a proof of the approximate version of this conjecture for large values of k. For our proof, we use a structural decomposition which can be seen as an analogue of Szemerédi’s regularity lemma for possibly very sparse ...
متن کامل