activity
20172022
most cited-intersecting families of graphs

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

collaborators

18 papers

math.CO2022

On the number of error correcting codes

Dingding Dong, Nitya Mani, Yufei Zhao

We show that for a fixed , the number of -ary -error correcting codes of length is at most for all $t \leq (1 - q^{-1})n - C_q\sqrt{n \log n}…

math.MG20211 cited

Exploring a planet, revisited

Yufei Zhao

How should we place great circles on a sphere to minimize the furthest distance between a point on the sphere and its nearest great circle? Fejes Tóth conjectured that the opti…

math.CO2021

Which graphs can be counted in -free graphs?

David Conlon, Jacob Fox, Benny Sudakov +1

For which graphs is there a sparse -counting lemma in -free graphs? We are interested in identifying graphs with the property that, roughly speaking, if is an $…

math.CO20212 cited

-intersecting families of graphs

Aaron Berger, Yufei Zhao

Ellis, Filmus, and Friedgut proved an old conjecture of Simonovits and Sós showing that the maximum size of a triangle-intersecting family of graphs on vertices has size at mos…

math.MG2021

The cylindrical width of transitive sets

Ashwin Sah, Mehtaab Sawhney, Yufei Zhao

We show that for every , every finite transitive set of unit vectors in lies within distance of some codimension $…

math.CO2020

A short proof of the canonical polynomial van der Waerden theorem

Jacob Fox, Yuval Wigderson, Yufei Zhao

We present a short new proof of the canonical polynomial van der Waerden theorem, recently established by Girao [arXiv:2004.07766].