Skip to main content
SpringerLink
Log in

On a conjecture of Bollobás and Erdős

  • Published:
Periodica Mathematica 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. B. Bollobás, On graphs with at most three independent paths connecting any two vertices,Studia Sci. Math. Hungar. 1 (1966), 137–140.

    Google Scholar 

  2. B. Bollobás andP. Erdős, On extremal problems in graph theory,Mat. Lapok 13 (1962), 143–152 (in Hungarian).

    Google Scholar 

  3. P. Erdős, Extremal problems in graph theory,A seminar on graph theory, ed. by F. Harary, New York, 1967, 54–59.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics College of Liberal Arts, The University of Arizona, 85721, Tucson, Arizona, U.S.A.

    John L. Leonard

Authors
  1. John L. Leonard
    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

Leonard, J.L. On a conjecture of Bollobás and Erdős. Period Math Hung 3, 281–284 (1973). https://doi.org/10.1007/BF02018594

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation