J. Kynčl

activity

20072026

most citedCrossing numbers and combinatorial characterization of monotone drawings of

K_{n}

30 citations · 208 across the 26 of their papers we have counts for

collaborators

Showing 2013 · math.COShow all

3 papers · 2 filters

math.CO2013★ 30 cited

Crossing numbers and combinatorial characterization of monotone drawings of $K_{n}$

Martin Balko, Radoslav Fulek, Jan Kynčl

In 1958, Hill conjectured that the minimum number of crossings in a drawing of $K_{n}$ is exactly $Z(n) = \frac{1}{4} \lfloor\frac{n}{2}\rfloor \left\lfloor\frac{n-1}{2}\right\rfloor…

math.CO2013★ 13 cited

Ramsey numbers of ordered graphs

Martin Balko, Josef Cibulka, Karel Král +1

An ordered graph is a pair $G = (G, ≺)$ where $G$ is a graph and $≺$ is a total ordering of its vertices. The ordered Ramsey number $R (G)$ is th…

math.CO2013★ 10 cited

Saturated simple and $k$ -simple topological graphs

Jan Kynčl, János Pach, Radoš Radoičić +1

A simple topological graph $G$ 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. $G$ is ca…

Crossing numbers and combinatorial characterization of monotone drawings of Kn​

Ramsey numbers of ordered graphs

Saturated simple and k-simple topological graphs

Crossing numbers and combinatorial characterization of monotone drawings of $K_{n}$

Saturated simple and $k$ -simple topological graphs