Degree powers in graphs with forbidden even cycle

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2009-03-31
dc.date.accessioned2026-07-07T12:58:29Z
dc.date.available2026-07-07T12:58:29Z
dc.descriptionWe prove a conjecture of Yuster and Caro about the sum of the p-powers of the degrees of a graph of order n without a specified even cycle. Our proof is based on a new sufficient condition for long paths, that may be useful in other applications as well.
dc.identifierhttps://arxiv.org/abs/0903.5352
dc.identifierhttp://arxiv.org/abs/0903.5352
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225256
dc.subjectCombinatorics
dc.subject05C35
dc.titleDegree powers in graphs with forbidden even cycle
dc.typetext

Files

Collections

arXiv