On semi-simple drawings of the complete graph

Oswin Aichholzer, Florian Ebenführer, Irene Parada, Alexander Pilz, Birgit Vogtenhuber

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

In this work we study rotation systems and semi-simple drawings of $K_n$. A simple drawing of a graph is a drawing in which every pair of edges intersects in at most one point. In a semi-simple drawing, edge pairs might intersect in multiple points, but incident edges only intersect in their common endpoint. A rotation system is called (semi-)realizable if it can be realized with a (semi-)simple drawing. It is known that a rotation system is realizable if and only if all its 5-tuples are realizable. For the problem of characterizing semi-realizability, we present a rotation system with six vertices that is not semi-realizable, although all its 5-tuples are semi-realizable. Moreover, by an exhaustive computer search, we show that also for seven vertices there exist minimal not semi-realizable rotation systems (that is, rotation systems in which all proper sub-rotation systems are semi-realizable). This indicates that checking semi-realizability is harder than checking realizability. Finally we show that for semi-simple drawings, generalizations of Conway's Thrackle Conjecture and the conjecture on the existence of plane Hamiltonian cycles do not hold.
Original languageEnglish
Title of host publicationProc. XVII Encuentros de Geometría Computacional
Place of PublicationAlicante, Spain
Pages25-28
Number of pages4
Publication statusPublished - 2017

Cite this

Aichholzer, O., Ebenführer, F., Parada, I., Pilz, A., & Vogtenhuber, B. (2017). On semi-simple drawings of the complete graph. In Proc. XVII Encuentros de Geometría Computacional (pp. 25-28). Alicante, Spain.

On semi-simple drawings of the complete graph. / Aichholzer, Oswin; Ebenführer, Florian; Parada, Irene; Pilz, Alexander; Vogtenhuber, Birgit.

Proc. XVII Encuentros de Geometría Computacional. Alicante, Spain, 2017. p. 25-28.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Aichholzer, O, Ebenführer, F, Parada, I, Pilz, A & Vogtenhuber, B 2017, On semi-simple drawings of the complete graph. in Proc. XVII Encuentros de Geometría Computacional. Alicante, Spain, pp. 25-28.
Aichholzer O, Ebenführer F, Parada I, Pilz A, Vogtenhuber B. On semi-simple drawings of the complete graph. In Proc. XVII Encuentros de Geometría Computacional. Alicante, Spain. 2017. p. 25-28
Aichholzer, Oswin ; Ebenführer, Florian ; Parada, Irene ; Pilz, Alexander ; Vogtenhuber, Birgit. / On semi-simple drawings of the complete graph. Proc. XVII Encuentros de Geometría Computacional. Alicante, Spain, 2017. pp. 25-28
@inproceedings{925e94bca487415fbc59124320899da9,
title = "On semi-simple drawings of the complete graph",
abstract = "In this work we study rotation systems and semi-simple drawings of $K_n$. A simple drawing of a graph is a drawing in which every pair of edges intersects in at most one point. In a semi-simple drawing, edge pairs might intersect in multiple points, but incident edges only intersect in their common endpoint. A rotation system is called (semi-)realizable if it can be realized with a (semi-)simple drawing. It is known that a rotation system is realizable if and only if all its 5-tuples are realizable. For the problem of characterizing semi-realizability, we present a rotation system with six vertices that is not semi-realizable, although all its 5-tuples are semi-realizable. Moreover, by an exhaustive computer search, we show that also for seven vertices there exist minimal not semi-realizable rotation systems (that is, rotation systems in which all proper sub-rotation systems are semi-realizable). This indicates that checking semi-realizability is harder than checking realizability. Finally we show that for semi-simple drawings, generalizations of Conway's Thrackle Conjecture and the conjecture on the existence of plane Hamiltonian cycles do not hold.",
author = "Oswin Aichholzer and Florian Ebenf{\"u}hrer and Irene Parada and Alexander Pilz and Birgit Vogtenhuber",
year = "2017",
language = "English",
pages = "25--28",
booktitle = "Proc. XVII Encuentros de Geometr{\'i}a Computacional",

}

TY - GEN

T1 - On semi-simple drawings of the complete graph

AU - Aichholzer, Oswin

AU - Ebenführer, Florian

AU - Parada, Irene

AU - Pilz, Alexander

AU - Vogtenhuber, Birgit

PY - 2017

Y1 - 2017

N2 - In this work we study rotation systems and semi-simple drawings of $K_n$. A simple drawing of a graph is a drawing in which every pair of edges intersects in at most one point. In a semi-simple drawing, edge pairs might intersect in multiple points, but incident edges only intersect in their common endpoint. A rotation system is called (semi-)realizable if it can be realized with a (semi-)simple drawing. It is known that a rotation system is realizable if and only if all its 5-tuples are realizable. For the problem of characterizing semi-realizability, we present a rotation system with six vertices that is not semi-realizable, although all its 5-tuples are semi-realizable. Moreover, by an exhaustive computer search, we show that also for seven vertices there exist minimal not semi-realizable rotation systems (that is, rotation systems in which all proper sub-rotation systems are semi-realizable). This indicates that checking semi-realizability is harder than checking realizability. Finally we show that for semi-simple drawings, generalizations of Conway's Thrackle Conjecture and the conjecture on the existence of plane Hamiltonian cycles do not hold.

AB - In this work we study rotation systems and semi-simple drawings of $K_n$. A simple drawing of a graph is a drawing in which every pair of edges intersects in at most one point. In a semi-simple drawing, edge pairs might intersect in multiple points, but incident edges only intersect in their common endpoint. A rotation system is called (semi-)realizable if it can be realized with a (semi-)simple drawing. It is known that a rotation system is realizable if and only if all its 5-tuples are realizable. For the problem of characterizing semi-realizability, we present a rotation system with six vertices that is not semi-realizable, although all its 5-tuples are semi-realizable. Moreover, by an exhaustive computer search, we show that also for seven vertices there exist minimal not semi-realizable rotation systems (that is, rotation systems in which all proper sub-rotation systems are semi-realizable). This indicates that checking semi-realizability is harder than checking realizability. Finally we show that for semi-simple drawings, generalizations of Conway's Thrackle Conjecture and the conjecture on the existence of plane Hamiltonian cycles do not hold.

M3 - Conference contribution

SP - 25

EP - 28

BT - Proc. XVII Encuentros de Geometría Computacional

CY - Alicante, Spain

ER -