Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8902993 | Discrete Mathematics | 2018 | 11 Pages |
Abstract
In this paper, we complete a stability theorem which strengthens Kopylov's result. In particular, we show that for kâ¥3 odd and all nâ¥k, every n-vertex 2-connected graph G with no cycle of length at least k is a subgraph of one of the two extremal graphs or e(G)â¤max{h(n,k,3),h(n,k,kâ32)}. The upper bound for e(G) here is tight.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zoltán Füredi, Alexandr Kostochka, Ruth Luo, Jacques Verstraëte,