30 citations · 208 across the 26 of their papers we have counts for
4 papers · 1 filter
Crossing numbers and combinatorial characterization of monotone drawings of
Martin Balko, Radoslav Fulek, Jan Kynčl
In 1958, Hill conjectured that the minimum number of crossings in a drawing of is exactly $Z(n) = \frac{1}{4} \lfloor\frac{n}{2}\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor…
Ramsey numbers of ordered graphs
Martin Balko, Josef Cibulka, Karel Král +1
An ordered graph is a pair where is a graph and is a total ordering of its vertices. The ordered Ramsey number is th…
Saturated simple and -simple topological graphs
Jan Kynčl, János Pach, Radoš Radoičić +1
A simple topological graph is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. is ca…
Clustered planarity testing revisited
Radoslav Fulek, Jan Kynčl, Igor Malinović +1
The Hanani--Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every p…