48 citations · 165 across the 65 of their papers we have counts for
Showing 2010 · math.COShow all
3 papers · 2 filters
math.CO2010★ 3 cited
Drawing planar graphs of bounded degree with few slopes
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
We settle a problem of Dujmović, Eppstein, Suderman, and Wood by showing that there exists a function with the property that every planar graph with maximum degree admi…
math.CO2010★ 4 cited
Overlap properties of geometric expanders
Jacob Fox, Mikhail Gromov, Vincent Lafforgue +2
The {\em overlap number} of a finite -uniform hypergraph is defined as the largest constant such that no matter how we map the vertices of into $\R^d…
math.CO2010
A computational approach to Conway's thrackle conjecture
Radoslav Fulek, Janos Pach
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum n…