3 citations · 4 across the 11 of their papers we have counts for
1 paper · 2 filters
Alexandru Pascadi
We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to k-cycle…