Degree powers in graphs with forbidden even cycle
Combinatorics
2009-04-01 v1
Abstract
We 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.
Keywords
Cite
@article{arxiv.0903.5352,
title = {Degree powers in graphs with forbidden even cycle},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:0903.5352},
year = {2009}
}