arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.2250math.COmath.NT
收藏

任意正则图的Cauchy-Davenport型结果

A Cauchy-Davenport type result for arbitrary regular graphs

Peter Hegarty

摘要:

受Cauchy-Davenport和集定理及其在Cayley图中的解释的启发,我们证明了以下主要结果:存在一个普适常数e > 0,使得如果G是n个顶点的连通正则图,则G的每对顶点都可以通过一条长度不超过3的路连接,或者这样的顶点对的数目至少是G中边数的1+e倍。我们讨论了这一结果所引起的一系列进一步的问题。

英文摘要:

Motivated by the Cauchy-Davenport theorem for sumsets, and its interpretation in terms of Cayley graphs, we prove the following main result : There is a universal constant e > 0 such that, if G is a connected, regular graph on n vertices, then either every pair of vertices can be connected by a path of length at most 3, or the number of pairs of such vertices is at least 1+e times the number of edges in G. We discuss a range of further questions to which this result gives rise.

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

↑