The Cycle-Complete graph Ramsey numbers

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2004-04-27
dc.date.accessioned2026-07-07T05:07:46Z
dc.date.available2026-07-07T05:07:46Z
dc.descriptionWe find the Ramsey number of a cycle vs. a complete graph when the order of the cycle is at least 4 times as large as the order of the complete graph. This partially confirms a conjecture of Erdős, Faudree, Rousseau, and Schelp made in 1978.
dc.description23 pages, accepted in Comb. Prob. and Comp
dc.identifierhttps://arxiv.org/abs/math/0404501
dc.identifierhttp://arxiv.org/abs/math/0404501
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70989
dc.subjectCombinatorics
dc.subject05D10
dc.titleThe Cycle-Complete graph Ramsey numbers
dc.typetext

Files

Collections

arXiv