Degree powers in graphs with forbidden even cycle
classification
🧮 math.CO
keywords
cycleevenapplicationscaroconditionconjecturedegreedegrees
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.