Forbidding induced even cycles in a graph: Typical structure and counting

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 43
  • Download : 0
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
DOI
10.1016/j.jctb.2018.02.002
URI
http://hdl.handle.net/10203/263340
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 webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0