Regular decomposition of the edge set of graphs with applications
Béla Csaba·2021-09-26·via math.CO updates on arXiv.org
We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemerédi in some graph embedding problems. An algorithmic version is also given.