Modularity of minor-free graphs
Combinatorics
2021-02-16 v1
Abstract
We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.
Cite
@article{arxiv.2102.07253,
title = {Modularity of minor-free graphs},
author = {Michał Lasoń and Małgorzata Sulkowska},
journal= {arXiv preprint arXiv:2102.07253},
year = {2021}
}
Comments
7 pages, 1 figure