Simple cycles
| dc.creator | Rivin, Igor | |
| dc.date | 1999-10-19 | |
| dc.date.accessioned | 2026-07-07T05:31:12Z | |
| dc.date.available | 2026-07-07T05:31:12Z | |
| dc.description | 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. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/math/9910093 | |
| dc.identifier | http://arxiv.org/abs/math/9910093 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79256 | |
| dc.subject | Combinatorics | |
| dc.subject | Classical Analysis and ODEs | |
| dc.subject | 05C35; 05C12; 26D2 | |
| dc.title | Simple cycles | |
| dc.type | text |