Zach Hunter

activity

20232026

K_{s, s}

-free graphs with polynomial average degree

2 citations · 2 across the 19 of their papers we have counts for

collaborators

Showing 2025Show all

5 papers · 1 filter

math.CO2025

Gaussian random graphs and Ramsey numbers

Zach Hunter, Aleksa Milojević, Benny Sudakov

We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction bas…

math.CO2025

Cyclic subsets of tournaments

Zach Hunter, Teng Liu, Aleksa Milojević +1

Let $G$ be a Dirac graph, and let $S$ be a vertex subset of $G$ , chosen uniformly at random. How likely is the induced subgraph $G [S]$ to be Hamiltonian? This question, proposed by…

math.CO2025

An improved construction for the triangle removal lemma

Zach Hunter

We construct $n$ -vertex graphs $G$ where $ε n^{2}$ edges must be deleted to become triangle-free, which contain less than $ε^{(C_{new} - o (1)) l o g_{2} 1/ ε} n^{3}$ triangles for $C_{\t…

math.CO2025

$C_{4}$ -free subgraphs of high degree with geometric applications

Zach Hunter, Aleksa Milojević, Istvan Tomon +1

The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an $n$ -vertex graph that does not contain the complete bipartite g…

math.CO2025

Lower bounds for Ramsey numbers of bounded degree hypergraphs

Domagoj Bradač, Zach Hunter, Benny Sudakov

We prove that, for all $k \geq 3,$ and any integers $Δ, n$ with $n \geq Δ,$ there exists a $k$ -uniform hypergraph on $n$ vertices with maximum degree at most $Δ$ whose $4$ -color Rams…

Gaussian random graphs and Ramsey numbers

Cyclic subsets of tournaments

An improved construction for the triangle removal lemma

C4​-free subgraphs of high degree with geometric applications

Lower bounds for Ramsey numbers of bounded degree hypergraphs

$C_{4}$ -free subgraphs of high degree with geometric applications