1 paper
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…