Mar 10, 2026
The crossing number conundrum
Date: March 10, 2026 |
4:00 pm –
5:00 pm
Speaker:
János Pach
Location: Raiffeisen Lecture Hall, Central Building
Language:
English
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?
