Simple cycles

MaRDI QIDQ6501514arXivFDO

Authors Igor Rivin

Published in arXiv

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Abstract: We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power sums.

This page was built for publication: Simple cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6501514)