A Cauchy-Davenport type result for arbitrary regular graphs

Details A Cauchy-Davenport type result for arbitrary regular graphs A Cauchy-Davenport type result for arbitrary regular graphs

2009-10-12

arxiv.org/abs/0910.2250v2

Mathematics

Combinatorics

7 pages. Version 2 : typos corrected, acknowledgements added. This version has been submitted for publication

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Cauchy-Davenport type result for arbitrary regular graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Cauchy-Davenport type result for arbitrary regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Cauchy-Davenport type result for arbitrary regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-639765