Jonathan Tidor

activity

20242026

collaborators

7 papers

math.CO2026

$K_{2, t + 1}$ -free graphs with many copies of $K_{t, t}$

Cosmin Pohoata, Jonathan Tidor, Hung-Hsun Hans Yu

For every fixed integer $t \geq 3$ , we construct an $n$ -vertex $K_{2, t + 1}$ -free graph containing $I^c ◯_{t} (n^{2})$ copies of $K_{t, t}$ . Combined with a simple counting argument, this show…

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 $d$ . One of our results is that if an intersection graph of $n$ spheres i…

math.CO2025

Triangle Ramsey numbers of complete graphs

Jacob Fox, Jonathan Tidor, Shengtong Zhang

A graph is $H$ -Ramsey if every two-coloring of its edges contains a monochromatic copy of $H$ . Define the $F$ -Ramsey number of $H$ , denoted by $r_{F} (H)$ , to be the minimum number of…

math.CO2025

More unit distances in arbitrary norms

Josef Greilhuber, Carl Schildkraut, Jonathan Tidor

For $d \geq 2$ and any norm on $R^{d}$ , we prove that there exists a set of $n$ points that spans at least $(\frac{d}{2} - o (1)) n lo g_{2} n$ unit distances under this norm for every…

math.CO2025

Uniform sets with few progressions via colorings

Mingyang Deng, Jonathan Tidor, Yufei Zhao

Ruzsa asked whether there exist Fourier-uniform subsets of $Z / N Z$ with density $I^\pm$ and 4-term arithmetic progression (4-AP) density at most $I^\pm^{C}$ , for arbitrarily…

math.CO2024

Multilevel polynomial partitioning and semialgebraic hypergraphs: regularity, TurÃ¡n, and Zarankiewicz results

Jonathan Tidor, Hung-Hsun Hans Yu

We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$ -uniform semi…

K2,t+1​-free graphs with many copies of Kt,t​

Separators for intersection graphs of spheres

Triangle Ramsey numbers of complete graphs

More unit distances in arbitrary norms

Uniform sets with few progressions via colorings

Multilevel polynomial partitioning and semialgebraic hypergraphs: regularity, TurÃ¡n, and Zarankiewicz results

$K_{2, t + 1}$ -free graphs with many copies of $K_{t, t}$