Abstract
Recently Komlós, Sárközy, and Szemerédi proved a striking result called the blow-up lemma that, loosely speaking, enables one to embed any bounded degree graph H as a spanning subgraph of an e-regular graph G. The first proof given by Komlós, Sárközy, and Szemerédi was based on a probabilistic argument [8]. Subsequently, they derandomized their approach to provide an algorithmic embedding in [9]. In this paper we give a different proof of the algorithmic version of the blow-up lemma. Our approach is based on a derandomization of a probabilistic proof of the blow-up lemma given in [13]. The derandomization utilizes the Erdös-Selfridge method of conditional probabilities and the technique of pessimistic estimators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, R. Duke, H. Leffman, V. Rödl, and R. Yuster, “The algorithmic aspects of the regularity lemma”, Journal of Algorithms, vol. 16 (1994), pp. 80–109.
N. Alon, V. Rödl, and A. Ruciński, “Perfect matchings in ε-regular graphs”, The Electronic J. of Combin., vol. 5(1) (1998), # R13.
N. Alon and J. Spencer, The Probabilistic Method, Wiley, New York, 1992.
P. Erdös and J. L. Selfridge, “On a combinatorial game”, Journal of Combinatorial Theory, Series A, vol. 14 (1973), pp. 298–301.
A. Hajnal and E. Szemerédi, “Proof of a conjecture of Erdös”, Combinatorial Theory and its Applications, vol. II (P. Erdós, A. Rényi, and V.T. Sós eds), Colloq. Math. Soc. J. Bolyai 4, North Holland, Amsterdam, 1970, pp. 601–623.
J. E. Hopcroft R. M. Karp, “An n5/2 algorithm for maximum matchings in bipartite graphs”, SIAM J. Comput, vol. 2 (1973), pp. 225–231.
S. Janson, T. łuczak, and A. Ruciński, Topics in Random Graphs, Wiley, New York, 1999.
J. Komlós, G. N. Sárközy, and E. Szemerédi, “Blow-up lemma”, Combinatorica, vol. 17 (1997), pp. 109–123.
J. Komlós, G. N. Sárközy, and E. Szemerédi, “An algorithmic version of the blowup lemma”, Random Structures and Algorithms, vol. 12 (1998), pp. 297–312.
J. Komlós, G. N. Sárközy and E. Szemerédi “On the Pósa-Seymour conjecture J. Graph Theory”, Journal of Graph Theory, to appear
J. Komlós, G. N. Sárközy and E. Szemerédi “Proof of the Alon-Yuster conjecture” submitted
P. Raghavan, “Probabilistic construction of deterministic algorithms: Approximating packing integer programs”, Journal of Computer and System Sciences, vol. 37 (1988), pp. 130–143.
V. Rödl and A. Ruciński, “Perfect matchings in ε-regular graphs and the blow-up lemma”, submitted.
N. Sauer and J. Spencer, “Edge disjoint placement of graphs”, J. Comb. Th. B, vol. 25 (1978), pp. 295–302.
E. Szemerédi “Partitions of graphs” Problems Combin. et Theorie des graphes, Edition du C.N.R.S. vol. 260 (1978), pp. 399–402.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rödl, V., Ruciński, A., Wagner, M. (1998). An Algorithmic Embedding of Graphs via Perfect Matchings. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_3
Download citation
DOI: https://doi.org/10.1007/3-540-49543-6_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65142-0
Online ISBN: 978-3-540-49543-7
eBook Packages: Springer Book Archive