Showing 2021Show all
2 papers · 1 filter
math.CO2021
A slightly better bound on the crossing number in terms of the pair-crossing number
János Karl, Géza Tóth
The crossing number of a graph , ${\mbox{cr}}(G)$, is the minimum number of crossings, the pair-crossing number, ${\mbox{pcr}}(G)$, is the minimum number of pairs of crossing ed…
math.CO2021
On the hollow enclosed by convex sets
Jenő Lehel, Géza Tóth
For , a family of compact convex sets in is called an -critical family provided any members of have a non-empty…