Journal article
On the purity of minor-closed classes of graphs
- Abstract:
-
Given a graph H with at least one edge, let gapH(n) denote the maximum difference between the numbers of edges in two n-vertex edge-maximal graphs with no minor H. We show that for exactly four connected graphs H (with at least two vertices), the class of graphs with no minor H is pure, that is, gapH(n) = 0 for all n ≥ 1; and for each connected graph H (with at least two vertices) we have the dichotomy that either gapH(n) = O(1) or gapH(n) = ⊝(n). Further, if H is 2-connected and does not yie...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 267.8KB)
-
- Publisher copy:
- 10.1016/j.jctb.2018.08.010
Authors
Bibliographic Details
- Publisher:
- Elsevier Publisher's website
- Journal:
- Journal of Combinatorial Theory. Series B Journal website
- Volume:
- 135
- Pages:
- 295-318
- Publication date:
- 2018-09-05
- Acceptance date:
- 2018-08-31
- DOI:
- EISSN:
-
1096-0902
- ISSN:
-
0095-8956
Item Description
- Keywords:
- Pubs id:
-
pubs:641935
- UUID:
-
uuid:c43d6645-1b7a-4380-b4dc-4d677ee34470
- Local pid:
- pubs:641935
- Source identifiers:
-
641935
- Deposit date:
- 2018-10-10
Terms of use
- Copyright holder:
- Elsevier Inc
- Copyright date:
- 2018
- Notes:
- Copyright © 2018 Elsevier Inc. This is the accepted manuscript version of the article. The final version is available online from Elsevier at: https://doi.org/10.1016/j.jctb.2018.08.010
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record