10. Mar 2026
The crossing number conundrum
Datum: 10. March 2026 |
16:00 –
17:00
Sprecher:
János Pach
Veranstaltungsort: Raiffeisen Lecture Hall, Central Building
Sprache:
Englisch
The crossing number ) of a graph , is defined as the smallest number of crossing points between the edges of in the best drawing of in the plane. There is another, equally natural, parameter: the pair-crossing number, denoted by ). This is the smallest number of crossing pairs of edges in an optimal drawing. Obviously, we have )≤cr(G), for every graph . But are these two numbers always equal?
