MULTIPLY CHORDED CYCLES

作者：Gould Ronald^*; Horn Paul; Magnant Colton

来源：SIAM Journal on Discrete Mathematics, 2014, 28(1): 160-172.

DOI：10.1137/12089569X

• chorded cycles
• minimum degree

A classical result of Hajnal and Szemeredi, 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.

• 出版日期2014