Journal title
Journal of Combinatorial Theory. Series B
DOI
10.1016/j.jctb.2020.03.006
Last updated
2023-12-19T05:08:13.047+00:00
Abstract
© 2020 Elsevier Inc. 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].
Symplectic ID
1069816
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article