Skip to main content
SpringerLink
Log in

Latest results on crossing numbers

  • Conference paper
  • First Online:
Recent Trends in Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 186))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blažek, J. and Koman, M., A minimal problem concerning complete plane graphs, in Fiedler, M. (ed.), Theory of graphs and its applications. Proc. Symp. Smolenice, 1963, Publ. House, Č.A.S., Prague, 1964, 113–117; M.R. 30(1965), #4249.

    Google Scholar 

  2. Blažek, J. and Koman, M., On an extremal problem concerning graphs, Comm. Math. Univ. Carolinae, 8(1967), 49–52; M.R. 35(1968), #1506.

    MathSciNet  MATH  Google Scholar 

  3. Eggleton, R.B. and Guy, R.K., The crossing number of the n-cube, Amer. Math. Soc. Notices, 17(1970), 757. A fuller version will be submitted to Canad. J. Math.

    Google Scholar 

  4. Eggleton, R.B. and Guy, R.K., The crossing number of the complete graph. To be submitted to J. Combinatorial Theory.

    Google Scholar 

  5. Fáry, I., On straight line representation of planar graphs, Acta Sci. Math. (Szeged), 11(1948), 229–233; M.R. 10(1949), 136.

    MathSciNet  MATH  Google Scholar 

  6. Guy, R.K., A combinatorial problem, Nabla (Bull. Malayan Math. Soc.), 7(1960), 68–72.

    MathSciNet  Google Scholar 

  7. Guy, R.K., The crossing number of the complete graph. Univ. of Calgary Math. Res. Paper #8, 1967.

    Google Scholar 

  8. Guy, R.K., The decline and fall of Zarankiewicz’s theorem, in Harary, F. (ed.), Proof techniques in graph theory, Academic Press, 1969, 63–69.

    Google Scholar 

  9. Guy, R.K., Sequences associated with a problem of Turán and other problems, Proc. Balatonfűred Combinatorics Conf., 1969, Bolyai Janos Matematikai Tarsultat, Budapest, 1970.

    Google Scholar 

  10. Guy, R.K. and Harary, F., On the Möbius ladders, Canad. Math. Bull., 10(1967), 493–496; also Mat. Lapok, 18(1967), 59–60; M.R. 37(1969), #98, 2627.

    Article  MathSciNet  MATH  Google Scholar 

  11. Guy, R.K. and Jenkyns, T.A., The toroidal crossing number of K m,n , J. Combinatorial Theory, 6(1969), 235–250; M.R. 38(1969), #5660.

    Article  MathSciNet  MATH  Google Scholar 

  12. Guy, R.K., Jenkyns, T.A. and Schaer, J., The toroidal crossing number of the complete graph, J. Combinatorial Theory, 4(1968), 376–390; M.R. 36(1968), #3682.

    Article  MathSciNet  MATH  Google Scholar 

  13. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969.

    MATH  Google Scholar 

  14. Harary, F. and Hill, A., On the number of crossings in a complete graph, Proc. Edinburgh Math. Soc. (2), 13(1962–3), 333–338; M.R. 29(1965), #602.

    MathSciNet  MATH  Google Scholar 

  15. Holroyd, E.M., A lower bound for the crossing number of a complete graph, Road Research Lab. (Britain), Technical Note TN303, May, 1968.

    Google Scholar 

  16. Jensen, H.F., An upper bound for the rectilinear crossing number of the complete graph, J. Combinatorial Theory, 9(1970)

    Google Scholar 

  17. Kainen, P.C., On a problem of Erdös, J. Combinatorial Theory, 5(1968), 374–377; M.R. 38(1969), #72.

    Article  MathSciNet  MATH  Google Scholar 

  18. Kleitman, D.J., The crossing number of K 5,n , Univ. of Calgary Math. Res. Report #65, Nov. 1968. To appear in J. Combinatorial Theory, 9(1970).

    Google Scholar 

  19. Kuratowski, K., Sur la problème des courbes gauches en topologie, Fund. Math., 15(1930), 271–283.

    MATH  Google Scholar 

  20. Moon, J.W., On the distribution of crossings in random complete graphs, J. Soc. Indust. App. Math., 13(1965), 506–510; M.R. 31(1966), #3357.

    Article  MathSciNet  MATH  Google Scholar 

  21. Saaty, T.L., The minimum number of intersections in complete graphs, Proc. Nat. Acad. Sci., U.S.A., 52(1964), 688–690; M.R. 29(1965), #4045.

    Article  MathSciNet  MATH  Google Scholar 

  22. Saaty, T.L., Two theorems on the minimum number of intersections for complete graphs, J. Combinatorial Theory, 2(1967), 571–584; M.R. 35(1968), #2796.

    Article  MathSciNet  MATH  Google Scholar 

  23. Saaty, T.L., Symmetry and the crossing number for complete graphs, J. Res. Nat. Bureau Standards, 73B(1969), 177–186.

    MathSciNet  MATH  Google Scholar 

  24. Tutte, W.T., Towards a theory of crossing numbers, J. Combinatorial Theory, 8(1970), 45–53.

    Article  MathSciNet  MATH  Google Scholar 

  25. Urbaník, K., Solution du problème posé par P. Turán, Colloq. Math., 3(1955), 200–201.

    Google Scholar 

  26. Zarankiewicz, K., On a problem of P. Turán concerning graphs, Fund. Math., 41(1954), 137–145; M.R. 16(1955), 156.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Calgary, Calgary 44, Alberta, Canada

    Richard K. Guy

Authors
  1. Richard K. Guy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Capobianco J. B. Frechen M. Krolik

Rights and permissions

Reprints and permissions

Copyright information

© 1971 Springer-Verlag

About this paper

Cite this paper

Guy, R.K. (1971). Latest results on crossing numbers. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059432

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05386-6

  • Online ISBN: 978-3-540-36508-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation