A note on the cross-index of a complete graph based on a linear tree

In this paper it is shown that a complete graph with $n$ vertices has an optimal diagram, i.e., a diagram whose crossing number equals the value of Guy's formula, with a free maximal linear tree and without free hamiltonian cycles for any odd integer $n \ge 7$.

Bibliographische Detailangaben

Hauptverfasser:	Gokan, Yusuke, Katsumata, Hayato, Nakajima, Katsuya, Shimizu, Ayaka, Yaguchi, Yoshiro
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics Mathematics - Geometric Topology
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!