×

zbMATH — the first resource for mathematics

Drawings of the complete graph with maximum number of crossings. (English) Zbl 0792.05043
Hoffman, Frederick (ed.) et al., Proceedings of the twenty-third Southeastern international conference on combinatorics, graph theory, and computing, held at Florida Atlantic University, Boca Raton, FL, USA, February 3-7, 1992. Winnipeg: Utilitas Mathematica Publishing Inc.. Congr. Numerantium. 88, 225-228 (1992).
A drawing of a graph here means a realization of the graph in the plane such that two edges have at most one point in common, which is either a vertex or a crossing. This paper provides a procedure to find a drawing of the complete graph with maximum number of crossings.
For the entire collection see [Zbl 0772.00026].

MSC:
05C10 Planar graphs; geometric and topological aspects of graph theory
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite