10 citations · 10 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2026
A computer-assisted proof of Kuperberg's six-cylinder conjecture
Ivan Matić, Rados Radoičić
We prove that at most six pairwise non-overlapping infinite unit cylinders can simultaneously touch a unit ball. Six is achievable, so the answer to Kuperberg's question is exactly…
math.CO2013★ 10 cited
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…