Forbidding induced even cycles in a graph: Typical structure and counting
We determine, for all k >= 6, the typical structure of graphs that do not contain an induced 2k-cycle. This verifies a conjecture of Balogh and Butterfield. Surprisingly, the typical structure of such graphs is richer than that encountered in related results. The approach we take also yields an approximate result on the typical structure of graphs without an induced 8-cycle or without an induced 10-cycle. (C) 2018 Elsevier Inc. All rights reserved.
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Issue Date
- 2018-07
- Language
- English
- Article Type
- Article
- Citation
JOURNAL OF COMBINATORIAL THEORY SERIES B, v.131, pp.170 - 219
- ISSN
- 0095-8956
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 2 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.