17 citations · 53 across the 27 of their papers we have counts for
1 paper · 2 filters
Igor Rivin
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 i…