Skip to main content
SpringerLink
Log in

Uniform Generation of d-Factors in Dense Host Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Given a constant integer d ≥  1 and a host graph H that is sufficiently dense, we lower bound the number of d-factors H contains. When the complement of H is sufficiently sparse, we provide an algorithm that uniformly generates the d-factors of H and we justify the efficiency of the algorithm.

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

References

  1. Bollobás B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Combin. 1, 311–316 (1980)

    Article  MATH  Google Scholar 

  2. Bender E.A., Canfield E.R.: The asymptotic number of labeled graphs with given degree sequences. J. Combin. Theory Ser. A24, 296–307 (1978)

    Article  MathSciNet  Google Scholar 

  3. Esperet, L., Kardos, F., King, A., Kral, D., Norine, S.: Exponentially many perfect matchings in cubic graphs (preprint)

  4. Jerrum, M., Sinclair, A.: Approximating the permanent. SIAM J. Comput. 18, 1149–1178

  5. McKay, B.D.: Subgraphs of random graphs with specified degrees. In: Proceedings of the International Congress of Mathematicians, vol. IV, pp. 2489–2501. Hindustan Book Agency, New Delhi (2010)

  6. McKay, B.D.: Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combin. 19A, 15–25 (1985)

    Google Scholar 

  7. McKay B.D., Wormald N.C.: Uniform generation of random regular graphs of moderate degree. J. Algorithms 11, 52–67 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. McKay B.D, Wormald N.C.: Asymptotic enumeration by degree sequence of graphs with degrees \({o(\sqrt{n})}\) . Combinatorica 11, 369–382 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. McKay B.D., Wormald N.C.: Asymptotic enumeration by degree sequence of graphs of high degree. Eur. J. Combin. 11, 565–580 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Pu Gao

    Present address: University of Toronto, Toronto, Canada

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Pu Gao

Authors
  1. Pu Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pu Gao.

Additional information

P. Gao: Research supported by the Humboldt Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gao, P. Uniform Generation of d-Factors in Dense Host Graphs. Graphs and Combinatorics 30, 581–589 (2014). https://doi.org/10.1007/s00373-013-1284-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-013-1284-1

Keywords

Search

Navigation