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. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.ejc.2018.08.002 | European Journal of Combinatorics |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Infimum and supremum,Mathematics | Journal | 75 |
ISSN | Citations | PageRank |
0195-6698 | 0 | 0.34 |
References | Authors | |
7 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Colin McDiarmid | 1 | 1071 | 167.05 |
Michal Przykucki | 2 | 35 | 6.79 |