An approximate blow-up lemma for sparse pseudorandom graphs
نویسندگان
چکیده
We state a sparse approximate version of the blow-up lemma, showing that regular partitions in sufficiently pseudorandom graphs behave almost like complete partite graphs for embedding graphs with maximum degree ∆. We show that (p, γ)-jumbled graphs, with γ = o(pmax(2∆,∆+3/2)n), are “sufficiently pseudorandom”. The approach extends to random graphs Gn,p with p ( log n n )1/∆.
منابع مشابه
Szemerédi’s Regularity Lemma for Sparse Graphs
A remarkable lemma of Szemerédi asserts that, very roughly speaking, any dense graph can be decomposed into a bounded number of pseudorandom bipartite graphs. This far-reaching result has proved to play a central rôle in many areas of combinatorics, both ‘pure’ and ‘algorithmic.’ The quest for an equally powerful variant of this lemma for sparse graphs has not yet been successful, but some prog...
متن کامل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...
متن کاملOn the Triangle Removal Lemma for Subgraphs of Sparse Pseudorandom Graphs
We study an extension of the triangle removal lemma of Ruzsa and Szemerédi [Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, NorthHolland, Amsterdam, 1978, pp. 939–945], which gave rise to a purely combinatorial proof of the fact that sets of integers of positive upper density contain three-term arithmetic progr...
متن کاملThe 12th International Conference on RANDOM STRUCTURES AND ALGORITHMS
Szemerédi’s regularity lemma has many applications, for example in extremal graph theory, in property testing, and in the development of approximation algorithms. By the nature of Szemerédi’s lemma, most applications have been to dense instances. In 1997 Kohayakawa and Rdl introduced a version of the regularity lemma that can be applied to a class of sparse graphs, namely so-called bounded grap...
متن کاملSparse Pseudorandom Objects
It has been known for a long time that many mathematical objects can be naturally decomposed into a ‘pseudorandom’, chaotic part and/or a highly organized ‘periodic’ component. Theorems or heuristics of this type have been used in combinatorics, harmonic analysis, dynamical systems and other parts of mathematics for many years, but a number of results related to such ‘structural’ theorems emerg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 44 شماره
صفحات -
تاریخ انتشار 2013