Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-24T22:54:49.533Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Number of Crossings in a Complete Graph

Published online by Cambridge University Press:  20 January 2009

Frank Harary  and
Anthony Hill
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The purpose of this article is to describe two problems which involve drawing graphs in the plane. We will discuss both complete graphs and complete bicoloured graphs. The complete graphKn with n points or vertices has a line or edge joining every pair of distinct points, as shown in fig. 1 for n = 2, 3, 4, 5, 6.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 13 , Issue 4 , December 1963 , pp. 333 - 338
Copyright
Copyright © Edinburgh Mathematical Society 1963

References

REFERENCES

FÁry, I.On straight line representation of planar graphs, Acta Univ. Szeged, 11 (1948), 229–233.Google Scholar
Guy, R.A combinatorial problem, Bull. Malayan Math. Soc., 7 (1960), 68–72.Google Scholar
Kuratowski, C.Sur le problème des courbes gauches en Topologie, Fund. Math., 16 (1930), 271–283.Google Scholar
Zarankiewicz, K.On a problem of P. Turán concerning graphs, Fund. Math., 41 (1954), 137–145.Google Scholar