1 citations · 2 across the 10 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2025★ 1 cited
Factorization norms and an inverse theorem for MaxCut
Igor Balla, Lianna Hambardzumyan, István Tomon
We prove that Boolean matrices with bounded -norm or bounded normalized trace norm must contain a linear-sized all-ones or all-zeros submatrix, verifying a conjecture of Hamba…
math.CO2017
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…