2 citations · 2 across the 19 of their papers we have counts for
10 papers · 1 filter
Sharp bounds for off-diagonal and tripartite canonical Ramsey numbers
Strahinja Gvozdić, Zach Hunter, Aleksa Milojević +1
The canonical Ramsey theorem establishes that for every positive integer , there is a sufficiently large such that every edge-colouring of a complete graph contains a…
Thinning and sprinkling: from robust sampling to almost Hamiltonicity
Micha Christoph, Zach Hunter, Benny Sudakov
We develop the thinning--sprinkling technique, a general method for proving robustness of graph properties under random vertex sampling. Using it, we show that random induced subgr…
Distinguishability threshold for random geometric graphs
Zach Hunter, Aleksa Milojević, Benny Sudakov
The spherical random geometric graph is obtained by sampling independent points uniformly on the unit sphere and joining pair…
Gilbreath's conjecture: a Cramér random model and a deterministic analysis
Zachary Chase, Zach Hunter, Terence Tao
Gilbreath's conjecture asserts that if one starts with the sequence of primes and takes successive absolute differences to create a triangular array, then the left diagonal of this…
Nearly tight bounds for induced subdivisions
Zach Hunter, Aleksa Milojević, Patryk Morawski +1
Subdivisions of complete graphs play a central role in combinatorics, having deep connections to structural, extremal, and topological aspects of graph theory. A celebrated conject…
Three-color van der Waerden numbers grow super-exponentially
Jacob Fox, Zach Hunter
For sufficiently large, we show that there is a three-coloring of the first positive integers without any monochromatic -term arithmetic progressions. T…
Communication Complexity of Disjointness under Product Distributions
Zach Hunter, Aleksa Milojević, Benny Sudakov +1
Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of B…
Permanents of random matrices over finite fields
Zach Hunter, Matthew Kwan, Lisa Sauermann
Fix a finite field and let be a uniformly random matrix over . The asymptotic distribution of the determinant…
Induced subdivisions of in graphs of high girth
António Girão, Zach Hunter
In this paper, we show that for all , every graph with minimum degree and girth at least contains an induced subdivision of a . This answers a probl…
Large point-line matchings and small Nikodym sets
Zach Hunter, Cosmin Pohoata, Jacques Verstraete +1
For any integer and prime power , we construct unexpectedly large induced matchings in the point-line incidence graph of by leveraging a new conn…