10 citations · 38 across the 54 of their papers we have counts for
5 papers · 1 filter
From small eigenvalues to large cuts, and Chowla's cosine problem
Zhihan Jin, Aleksa Milojević, István Tomon +1
We prove that every graph with average degree and smallest adjacency eigenvalue contains a clique of size . A simple corollary of this yields the fi…
Beyond the MaxCut problem in -free graphs
Zhihan Jin, Aleksa Milojević, István Tomon
In a recent breakthrough, Zhang proves that if is an -free graph with edges, then has a cut of size at least , making a significant step towards a…
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…
-free subgraphs of high degree with geometric applications
Zach Hunter, Aleksa Milojević, Istvan Tomon +1
The Zarankiewicz problem, a cornerstone problem in extremal graph theory, asks for the maximum number of edges in an -vertex graph that does not contain the complete bipartite g…
Factorization norms and Zarankiewicz problems
István Tomon
The -norm of Boolean matrices plays an important role in communication complexity and discrepancy theory. In this paper, we study combinatorial properties of this norm, and pr…