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 2014 · math.MGShow all

2 papers · 2 filters

math.MG2014★ 1 cited

On three measures of non-convexity

Josef Cibulka, Miroslav Korbelář, Jan Kynčl +3

The invisibility graph $I (X)$ of a set $X \subseteq R^{d}$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if a…

math.MG2014★ 7 cited

Bounds for Pach's selection theorem and for the minimum solid angle in a simplex

Roman Karasev, Jan Kynčl, Pavel Paták +2

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer $d$ there is a constant $c_{d} > 0$ such that whenever $X_1,..., X…