Simple cycles
组合数学
2007-05-23 v1 经典分析与常微分方程
摘要
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.
引用
@article{arxiv.math/9910093,
title = {Simple cycles},
author = {Igor Rivin},
journal= {arXiv preprint arXiv:math/9910093},
year = {2007}
}
备注
9 pages