Regular decomposition of the edge set of graphs with applications
Combinatorics
2021-10-27 v2
Abstract
We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.
Cite
@article{arxiv.2109.12394,
title = {Regular decomposition of the edge set of graphs with applications},
author = {Béla Csaba},
journal= {arXiv preprint arXiv:2109.12394},
year = {2021}
}