Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10118309 | European Journal of Combinatorics | 2019 | 26 Pages |
Abstract
Given a minor-closed class A of graphs, let βA denote the supremum over all graphs in A of the ratio of edges to vertices. We investigate the set B of all such values βA, taking further the project begun by Eppstein. Amongst other results, we determine the small values in B (those up to 2); we show that B is 'asymptotically dense'; and we answer some questions posed by Eppstein.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Colin McDiarmid, MichaÅ Przykucki,