Regular decomposition of the edge set of graphs with applications

Abstract

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.

References in corpus (2)

• The regularity method for graphs with few 4-cycles
• A new graph decomposition method for bipartite graphs

Cited by in corpus (1)

• An efficient asymmetric removal lemma and its limitations