Skip to main content
Log in

Perfect Matchings in ε-Regular Graphs and the Blow-Up Lemma

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

G

on vertex set , , with density d>2ε and all vertex degrees not too far from d, has about as many perfect matchings as a corresponding random bipartite graph, i.e. about .

In this paper we utilize that result to prove that with probability quickly approaching one, a perfect matching drawn randomly from G is spread evenly, in the sense that for any large subsets of vertices and , the number of edges of the matching spanned between S and T is close to |S||T|/n (c.f. Lemma 1).

As an application we give an alternative proof of the Blow-up Lemma of Komlós, Sárközy and Szemerédi [10].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 5, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rödl, V., Ruciński, A. Perfect Matchings in ε-Regular Graphs and the Blow-Up Lemma. Combinatorica 19, 437–452 (1999). https://doi.org/10.1007/s004930050063

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930050063

Navigation