Mathematical Sciences: Faculty Publications
Multiply Chorded Cycles
Document Type
Article
Publication Date
2014
Publication Title
SIAM Journal on Discrete Math
DOI
10.1137/12089569X
ISSN
1095-7146
Abstract
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that with sufficient minimum degree, a graph will contain disjoint large cliques. We conjecture a generalization of this result from cliques to cycles with many chords and prove this conjecture in several cases.
Recommended Citation
Gould, Ronald, Paul Horn, Colton Magnant.
2014.
"Multiply Chorded Cycles."
SIAM Journal on Discrete Math, 28 (1): 160-172.
doi: 10.1137/12089569X
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/302
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
