114 citations · 1k across the 63 of their papers we have counts for
6 papers · 1 filter
A reverse Sidorenko inequality
Ashwin Sah, Mehtaab Sawhney, David Stoner +1
Let be a graph allowing loops as well as vertex and edge weights. We prove that, for every triangle-free graph without isolated vertices, the weighted number of graph homom…
Hypergraph expanders of all uniformities from Cayley graphs
David Conlon, Jonathan Tidor, Yufei Zhao
Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, o…
On the number of Hadamard matrices via anti-concentration
Asaf Ferber, Vishesh Jain, Yufei Zhao
Many problems in combinatorial linear algebra require upper bounds on the number of solutions to an underdetermined system of linear equations , where the coordinates of th…
The number of independent sets in an irregular graph
Ashwin Sah, Mehtaab Sawhney, David Stoner +1
Settling Kahn's conjecture (2001), we prove the following upper bound on the number of independent sets in a graph without isolated vertices: \[ i(G) \le \prod_{uv \in E…
A fast new algorithm for weak graph regularity
Jacob Fox, László Miklós Lovász, Yufei Zhao
We provide a deterministic algorithm that finds, in time, an -regular Frieze-Kannan partition of a graph on vertices. The algorithm outputs an approximation…
Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
Noga Alon, Jacob Fox, Yufei Zhao
Let be an abelian group of bounded exponent and . We show that if the collection of translates of has VC dimension at most , then for every there is…