A new graph decomposition method for bipartite graphs
Combinatorics
2021-09-28 v1
Abstract
Given a sufficiently large and sufficiently dense bipartite graph we present a novel method for decomposing the majority of the edges of into quasirandom graphs so that the vertex sets of these quasirandom graphs partition the majority of The method works for relatively small or sparse graphs, and can be used to substitute the Regularity lemma of Szemer\'edi in some graph embedding problems.
Keywords
Cite
@article{arxiv.2109.12429,
title = {A new graph decomposition method for bipartite graphs},
author = {Béla Csaba},
journal= {arXiv preprint arXiv:2109.12429},
year = {2021}
}
Comments
Slightly modified version of the extended abstract from the proceedings of MATCOS-19