1 citations · 1 across the 12 of their papers we have counts for
6 papers · 1 filter
On the clique number of random Cayley graphs and related topics
David Conlon, Jacob Fox, Huy Tuan Pham +1
We prove that a random Cayley graph on a group of order has clique number with high probability. This bound is best possible up to the constant factor f…
On monochromatic solutions to linear equations over the integers
Dingding Dong, Nitya Mani, Huy Tuan Pham +1
We study the number of monochromatic solutions to linear equations in a -coloring of . We show that any nontrivial linear equation has a constant fraction of sol…
Spread blow-up lemma with an application to perturbed random graphs
Rajko Nenadov, Huy Tuan Pham
Combining ideas of Pham, Sah, Sawhney, and Simkin on spread perfect matchings in super-regular bipartite graphs with an algorithmic blow-up lemma, we prove a spread version of the…
Short proof of the hypergraph container theorem
Rajko Nenadov, Huy Tuan Pham
We present a short and simple proof of the celebrated hypergraph container theorem of Balogh--Morris--Samotij and Saxton--Thomason. On a high level, our argument utilises the idea…
The largest subgraph without a forbidden induced subgraph
Jacob Fox, Rajko Nenadov, Huy Tuan Pham
We initiate the systematic study of the following Turán-type question. Suppose is a graph with vertices such that the edge density between any pair of subsets of vertices o…
Sampling from Spherical Spin Glasses in Total Variation via Algorithmic Stochastic Localization
Brice Huang, Andrea Montanari, Huy Tuan Pham
We consider the problem of algorithmically sampling from the Gibbs measure of a mixed -spin spherical spin glass. We give a polynomial-time algorithm that samples from the Gibbs…