A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length
| dc.creator | Lai, Chunhui | |
| dc.date | 2002-06-06 | |
| dc.date | 2002-06-07 | |
| dc.date.accessioned | 2026-07-07T04:48:55Z | |
| dc.date.available | 2026-07-07T04:48:55Z | |
| dc.description | In 1975, P. Erdös proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+32t-1$$ for $t=27720r+169 (r\geq 1)$ and $n\geq{6911/16}t^{2}+{514441/8}t-{3309665/16}$. Consequently, $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + {2562 \over 6911}}.$ | |
| dc.description | 6 pages | |
| dc.identifier | https://arxiv.org/abs/math/0206050 | |
| dc.identifier | http://arxiv.org/abs/math/0206050 | |
| dc.identifier | The Electronic Journal of Combinatorics 8(2001), #N9 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64235 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C38, 05C35 | |
| dc.title | A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length | |
| dc.type | text |