Simple cycles
From MaRDI portal
Publication:6501514
arXivmath/9910093MaRDI QIDQ6501514
Author name not available (Why is that?)
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.
No records found.
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)