Journal article
Maximising the number of cycles in graphs with forbidden subgraphs
- Abstract:
- Fix k≥2 and let H be a graph with χ(H)=k+1 containing a critical edge. We show that for sufficiently large n, the unique n-vertex H-free graph containing the maximum number of cycles is Tk(n). This resolves both a question and a conjecture of Arman, Gunderson and Tsaturian [4].
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Accepted manuscript, 364.1KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jctb.2020.03.006
Authors
- Publisher:
- Elsevier
- Journal:
- Journal of Combinatorial Theory, Series B More from this journal
- Volume:
- 147
- Pages:
- 201-237
- Publication date:
- 2020-04-16
- Acceptance date:
- 2020-03-23
- DOI:
- EISSN:
-
1096-0902
- ISSN:
-
0095-8956
- Language:
-
English
- Keywords:
- Pubs id:
-
1069816
- Local pid:
-
pubs:1069816
- Deposit date:
-
2020-09-06
Terms of use
- Copyright holder:
- Elsevier Inc.
- Copyright date:
- 2020
- Rights statement:
- © 2020 Elsevier Inc. All rights reserved.
- Notes:
-
This is the accepted manuscript version of the article. The final version is available from Elsevier at https://doi.org/10.1016/j.jctb.2020.03.006
If you are the owner of this record, you can report an update to it here: Report update to this record