Skip to main content
SpringerLink
Log in

On the existence of a factor of degree one of a connected random graph

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica Aims and scope Submit manuscript

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

References

  1. P. Erdős-A. Rényi, On random graphs. I,Publicationes Mathematicae (Debrecen),6 (1959), pp. 290–297.

    Google Scholar 

  2. P. Erdős-A. Rényi, On the evolution of random graphs,Publ. Math. Inst. Hung. Acad. Sci.,5A (1960), pp. 17–61.

    Google Scholar 

  3. P. Erdős-A. Rényi, On the strength of connectedness of a random graph,Acta Math. Acad. Sci. Hung.,12 (1961), pp. 261–267.

    Google Scholar 

  4. W. T. Tutte, The factorization of linear graphs,Journal London Math. Soc.,22 (1947), pp. 107–111.

    Google Scholar 

  5. P. Erdős-A. Rényi, On random matrices,Publ. Math. Inst. Hung. Acad. Sci.,8A (1963), pp. 455–461.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Budapest

    P. Erdős (members of the Academy) & A. Rényi

Authors
  1. P. Erdős
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Rényi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erdős, P., Rényi, A. On the existence of a factor of degree one of a connected random graph. Acta Mathematica Academiae Scientiarum Hungaricae 17, 359–368 (1966). https://doi.org/10.1007/BF01894879

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation