Simple cycles

Details Simple cycles Simple cycles

1999-10-19

arxiv.org/abs/math/9910093v1

Mathematics

Combinatorics

9 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Simple cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361839