On the Number of Crossings in a Complete Graph
- 1 December 1963
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 13 (4), 333-338
- https://doi.org/10.1017/s0013091500025645
Abstract
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.Keywords
This publication has 2 references indexed in Scilit:
- On a problem of P. Turan concerning graphsFundamenta Mathematicae, 1955
- Sur le problème des courbes gauches en TopologieFundamenta Mathematicae, 1930