Skip to main content
Article
Multiply Chorded Cycles
SIAM Journal on Discrete Math
  • Ronald Gould
  • Paul Horn
  • Colton Magnant, Georgia Southern University
Document Type
Article
Publication Date
1-1-2014
DOI
10.1137/12089569X
Disciplines
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.

Citation Information
Ronald Gould, Paul Horn and Colton Magnant. "Multiply Chorded Cycles" SIAM Journal on Discrete Math Vol. 28 Iss. 1 (2014) p. 160 - 172
Available at: http://works.bepress.com/colton_magnant/43/