The Connectivity of addition Cayley graphs

N. Alon, Large sets in finite fields are sumsets, J. Number Theory, to appear

Cheyne, 2003, Hamilton Cycles in Addition Graphs, Rose-Hulman Undergraduate Math. Journal, 1

Chung, 1989, Diameters and eigenvalues, J. Amer. Math. Soc., 2, 187, 10.1090/S0894-0347-1989-0965008-X

Green, 2005, Counting sets with small sumset, and the clique number of random Cayley graphs, Combinatorica, 25, 307, 10.1007/s00493-005-0018-2

Grynkiewicz, 2005, Quasi-periodic decompositions and the Kemperman structure theorem, European Journal of Combinatorics, 26, 559, 10.1016/j.ejc.2004.06.011

D.J. Grynkiewicz, Sumsets, Zero-Sums and Extremal Combinatorics, Ph.D. Dissertation, Caltech (2005)

Kemperman, 1960, On small subsets in an abelian group, Acta Mathematica, 103, 63, 10.1007/BF02546525

Kneser, 1953, Abschätzung der asymptotischen Dichte von Summenmengen, Math. Z., 58, 459, 10.1007/BF01174162

Kneser, 1955, Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen, Math. Z., 61, 429, 10.1007/BF01181357

Lev, 2006, Critical pairs in abelian groups and Kemperman's structure theorem, Internation Journal of Number Theory, 2, 379, 10.1142/S1793042106000620

V.F. Lev, Sums and differences along Hamiltonian cycles, Submitted

Mann, 1976

Marušič, 1983, Hamiltonian circuits in Cayley graphs, Discrete Math., 46, 49, 10.1016/0012-365X(83)90269-8