65 citations · 108 across the 25 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
The Erdős distinct distances problem in
Jonathan Tidor, Hung-Hsun Hans Yu, Dmitrii Zakharov
We prove that points in determine at least distinct distances.
math.CO2026
-free graphs with many copies of
Cosmin Pohoata, Jonathan Tidor, Hung-Hsun Hans Yu
For every fixed integer , we construct an -vertex -free graph containing copies of . Combined with a simple counting argument, this shows…
cs.CG2026
Separators for intersection graphs of spheres
Jacob Fox, Jonathan Tidor
We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension . One of our results is that if an intersection graph of spheres i…