Skip to main content
SpringerLink
Log in

Random Lifts Of Graphs: Perfect Matchings

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

We study random lifts of a graph G as defined in [1]. We prove a 0-1 law which states that for every graph G either almost every lift of G has a perfect matching, or almost none of its lifts has a perfect matching. We provide a precise description of this dichotomy. Roughly speaking, the a.s. existence of a perfect matching in the lift depends on the existence of a fractional perfect matching in G. The precise statement appears in Theorem 1.

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

Access this article

Log in via an institution

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

  1. Institute of Computer Science, Hebrew University, Jerusalem 91904, Israel

    Nathan Linial*

  2. Institute of Computer Science, Hebrew University, Jerusalem 91904, Israel

    Eyal Rozenman

Authors
  1. Nathan Linial*
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eyal Rozenman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nathan Linial*.

Additional information

* Supported in part by BSF and by the Israeli academy of sciences.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Linial*, N., Rozenman, E. Random Lifts Of Graphs: Perfect Matchings. Combinatorica 25, 407–424 (2005). https://doi.org/10.1007/s00493-005-0024-8

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-005-0024-8

Mathematics Subject Classification (2000):

Search

Navigation