arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0206050math.CO
收藏

不含两个等长圈的图的边数的下界

A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length

Chunhui Lai

摘要:

1975年,P.Erdös提出了确定$n$顶点图中任意两个圈的长度不同的最大边数$f(n)$的问题。本文证明了$$f(n)\geq n+32t-1$$对于$t=27720r+169 (r\geq 1)$和$n\geq{6911/16}t^{2}+{514441/8}t-{3309665/16}$是等价的.因此,$\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + {2562 \over 6911}}.$

英文摘要:

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}}.$

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑