4 citations · 6 across the 4 of their papers we have counts for
4 papers
Asymptotic Density of Graphs Excluding Disconnected Minors
Rohan Kapadia, Sergey Norin, Yingjie Qian
For a graph , let where the maximum is taken over all graphs on vertices not containing as a minor. Thus…
Lower bounds for graph bootstrap percolation via properties of polynomials
Lianna Hambardzumyan, Hamed Hatami, Yingjie Qian
We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process. We apply this method to determine the sizes…
The Unbounded-Error Communication Complexity of symmetric XOR functions
Hamed Hatami, Yingjie Qian
Settling a conjecture of Shi and Zhang, we determine the unbounded-error communication complexity of the symmetric XOR functions up to a poly-logarithmic factor. Our proof is by a…
Teaching dimension, VC dimension, and critical sets in Latin squares
Hamed Hatami, Yingjie Qian
A critical set in an Latin square is a minimal set of entries that uniquely identifies it among all Latin squares of the same size. It is conjectured by Nelder in 1979…