On the critical densities of minor-closed classes
Combinatorics
2018-08-03 v2
Abstract
Given a minor-closed class of graphs, let denote the supremum over all graphs in of the ratio of edges to vertices. We investigate the set of all such values , taking further the project begun by Eppstein. Amongst other results, we determine the small values in (those up to 2); we show that is `asymptotically dense'; and we answer some questions posed by Eppstein.
Keywords
Cite
@article{arxiv.1711.06052,
title = {On the critical densities of minor-closed classes},
author = {Colin McDiarmid and Michał Przykucki},
journal= {arXiv preprint arXiv:1711.06052},
year = {2018}
}
Comments
31 pages, 4 figures. Copyright 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 License. Manuscript has been accepted to the European Journal of Combinatorics