Perfect matchings in ∈-regular graphs and the blow-up Lemma

Combinatorica

Volumn 19, Issue 3, 1999, Pages 437-452

  Rödl, Vojtech ^a   Ruciński, Andrzej ^b  

^a EMORY UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17344389360     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050063     Document Type: Article

References (14)

1. N. ALON, R. DUKE, H. LEFMANN, V. RÖDL and R. YUSTER: The algorithmic aspects of the regularity lemma, Journal of Algorithms, 16 (1994), 80-109.
2. N. ALON, V. RÖDL and A. RUCIŃSKI: Perfect matchings in ∈-regular graphs Electronic J. Combin., 5(1)# R13 (1998), 1-3.
3. N. ALON and J. SPENCER: The Probabilistic Method, Wiley, New York, 1992.
4. V. CHVATÁL, V. RÖDL, E. SZEMERÉDI, and W. T. TROTTER JR.: The Ramsey number of a graph with bounded maximum degree, J. Combin. Theory, Ser. B, 34 (1983), 239-243.
5. R. DUKE, H. LEFMANN and V. RÖDL: A fast approximation algorithm for computing the frequencies of subgraphs of a given graph, SIAM Journal of Computing, 24 (1995), 598-020.
6. A. HAJNAL and E. SZEMERÉDI: Proof of a conjecture of Erdos, in: Combinatorial Theory and its Applications, vol. II (P. Erdos, A. Rényi and V. T. Sós eds.) Colloq. Math. Soc. J. Bolyai 4, North Holland, Amsterdam, 1970, 601-623.
7. S. JANSON, T. ŁUCZAK and A. RUCIŃSKI: Random Graphs, Wiley, New York, 1999, in print.
8. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: On the Pósa-Seymour conjecture, J. Graph Theory, to appear.
9. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: Proof of the Alon-Yuster conjecture, in preparation.
10. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: The Blow-up Lemma, Combinatorica 17 (1997), 109-123.
11. J. KOMLÓS, G. N. SÁRKÖZY and E. SZEMERÉDI: An algorithmic version of the Blow-up Lemma, Random Structures and Algorithms, 12 (1998), 297-312.
12. V. RÖDL, A. RUCIŃSKI and M. WAGNER: An algorithmic embedding of graphs via perfect matchings, Randomization and Approximation Techniques in Computer Science (M. Luby, J. Rolim and M. Serna, eds.) - Proc. Second Inter. Workshop RANDOM'98, Barcelona, Spain, October 1998, LNCS 1518 (1998), 25-34, Springer Berlin.
13. V. RÖDL, A. RUCIŃSKI, and E. SZEMERÉDI: Dirac's theorem for triple systems, in preparation.
14. E. SZEMERÉDI, Partitions of graphs, Problems Combin. et Théorie des graphes, Edition du C.N.R.S. 260 (1978), Paris, 399-402.