Hamiltonian paths in Cayley graphs

Discrete Mathematics

Volumn 309, Issue 17, 2009, Pages 5501-5508

  Pak, Igor ^a   Radoičić, Radoš ^b  

^a University of Minnesota   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

Expander graphs; Explicit constructions; Hamiltonian cycles and paths; Simple groups

Indexed keywords

CAYLEY GRAPHS; EXPANDER GRAPHS; EXPLICIT CONSTRUCTIONS; FINITE GROUPS; GENERATING SET; HAMILTONIAN CYCLE; HAMILTONIAN CYCLES AND PATHS; HAMILTONIAN PATH; SIMPLE GROUPS;

GRAPH THEORY; MEATS;

HAMILTONIANS;

EID: 68049110173     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2009.02.018     Document Type: Article

References (60)

1. Ajtai M., Komlos J., and Szemeredi E. Sorting in c log n parallel steps. Combinatorica 3 (1983) 1-19
2. Alon N., and Roichman Y. Random Cayley graphs and expanders. Random Structures Algorithms 5 (1994) 271-284
3. Babai L. Automorphism groups, isomorphism, reconstruction. In: Graham R.L., Groetschel M., and Lovasz L. (Eds). Handbook of Combinatorics (1996), Elsevier
4. Babai L., and Pak I. Strong bias of group generators: An obstacle to the product replacement algorithm. J. Algorithms 50 (2004) 215-231
5. p). Ann. of Math. (2) 167 (2008) 625-642
6. Chung F., Diaconis P., and Graham R. Universal cycles for combinatorial structures. Discrete Math. 110 (1992) 43-59
7. Chvátal V. Tough graphs and Hamiltonian circuits. Discrete Math. 5 (1973) 215-228
8. Compton R.C., and Williamson S.G. Doubly adjacent Gray codes for the symmetric group. Linear Multilinear Algebra 35 (1993) 237-293
9. Conder M.D.E. More on generators for alternating and symmetric groups. Quart. J. Math. Oxford Ser. (2) 32 (1981) 137-163
10. Curran S.J., and Gallian J.A. Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey. Discrete Math. 156 (1996) 1-18
11. Diaconis P. Group Representations in Probability and Statistics (1988), Institute of Mathematical Statistics, Hayward, CA
12. Diestel R. Graph theory. Graduate Texts in Mathematics vol. 173 (1997), Springer, New York, NY
13. Fleischner H. The square of every two-connected graph is Hamiltonian. J. Combin. Theory Ser. B 16 (1974) 29-34
14. Gallai T. On directed paths and circuits. Theory of Graphs (Proc. Colloq., Tihany, 1966) (1968), Academic Press, New York 115-118
15. Garey M.R., and Johnson D.S. Computers and intractability. A Guide to the Theory of NP-Completeness (1979), Freeman, SF
16. Glover H.H., and Yang T.Y. A Hamilton cycle in the Cayley graph of the 〈 2, p, 3 〉 presentation of PSL(2, p). Discrete Math. 160 (1996) 149-163
17. Goldreich O., Impagliazzo R., Levin L.A., Venkatesan R., and Zuckerman D. Security preserving amplification of hardness. Proc. 31st IEEE FOCS (1990) 318-326
18. Gorenstein D. Finite simple groups. An Introduction to their Classification (1982), Plenum, New York
19. Hall P. The Eulerian functions of a group. Quart. J. Math. 7 (1936) 134-151
20. Humphries S.P. Personal Communication (2002)
21. Humphries S.P. Some subgroups of SL(3, Z) generated by involutions. Glasgow Math. J. 32 (1990) 127-136
22. Janson S., Łuczak T., and Rucinski A. Random Graphs (2000), Wiley, New York
23. Kantor W.M., and Lubotzky A. The probability of generating a finite classical group. Geom. Dedicata 36 (1990) 67-87
24. Knuth D.E. The Art of Computer Programming vol. 4 (2002) draft of Sections 7.2.1.1, 7.2.1.2
25. Kompel'maher V.L., and Liskovec V.A. Successive generation of permutations by means of a transposition basis. Kibernetika (1975) 17-21 (in Russian)
26. Krivelevich M., and Sudakov B. Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42 (2003) 17-33
27. Lovász L. Problem 11. Combinatorial Structures and their Applications, University of Calgary, Calgary, Alberta, Canada (1970), Gordon and Breach, New York
28. Lovász L. Combinatorial Problems and Exercises (1979), North-Holland, Amsterdam
29. Lovász L. Personal Communication (2001)
30. Lubotzky A. Discrete Groups, Expanding Graphs and Invariant Measures (1994), Birkhauser, Boston
31. Lubotzky A. Invited Talk at Durham Symposium (2001), Durham
32. Lubotzky A., and Pak I. The product replacement algorithm and Kazhdan's property (T). J. AMS 52 (2000) 5525-5561
33. Lubotzky A., Phillips R., and Sarnak P. Ramanujan graphs. Combinatorica 8 (1988) 261-277
34. Malle G., Saxl J., and Weigel T. Generation of classical groups. Geom. Dedicata 49 (1994) 85-116
35. Margulis G.A. Explicit constructions of expanders. Probl. Inf. Transm. 9 (1973) 325-332
36. Margulis G.A. Explicit group theoretic constructions of combinatorial schemes, and their applications for construction of expanders and concentrators. Probl. Inf. Transm. 24 (1988) 39-46
37. Mazurov V.D. On the generation of sporadic simple groups by three involutions, two of which commute. Siberian Math. J. 44 (2003) 160-164
38. In: Mazurov V.D., and Khukhro E.I. (Eds). Unsolved Problems in Group Theory. The Kourovka Notebook (1995), Institute of Mathematics, Novosibirsk (Thirteenth augmented ed.)
39. Meng J., and Huang Q. Almost all Cayley graphs are Hamiltonian. Acta Math. Sinica (N.S.) 12 (1996) 151-155
40. Nuzhin Ya.N. Generating triples of involutions of Chevalley groups over a finite field of characteristic 2. Algebra Logika 29 (1990) 192-206 261 (in Russian)
41. Nuzhin Ya.N. Generating triples of involutions of alternating groups. Mat. Zametki 51 (1992) 91-95 142 (in Russian)
42. Nuzhin Ya.N. Generating triples of involutions of Lie-type groups over a finite field of odd characteristic, I. Algebra Logika 36 (1997) 77-96 118 (in Russian)
43. Nuzhin Ya.N. Generating triples of involutions of Lie-type groups over a finite field of odd characteristic, II. Algebra Logika 36 (1997) 422-440 479 (in Russian)
44. Nuzhin Ya.N. Personal Communication (2002)
45. Pak I. Mixing time and long paths in graphs. Proc. 13th ACM-SIAM SODA (2000)
46. Rankin R.A. A campanological problem in group theory II. Proc. Cambridge Philos. Soc. 62 (1966) 11-18
47. Rapaport-Strasser E. Cayley color groups and Hamilton lines. Scripta Math. 24 (1959) 51-58
48. Reingold O., Vadhan S., and Wigderson A. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. Proc. 41st IEEE FOCS (2000)
49. Robinson R.W., and Wormald N.C. Almost all regular graphs are Hamiltonian. Random Structures Algorithms 5 (1994) 363-374
50. Schupp P.E. On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group. Theoret. Comput. Sci. 204 (1998) 233-248
51. Sipser M., and Spielman D.A. Expander codes. IEEE Trans. Inform. Theory 42 6 (1996) 1710-1722
52. Sjerve D., and Cherkassoff M. On groups generated by three involutions, two of which commute. The Hilton Symposium 1993 (Montreal, PQ). CRM Proc. Lecture Notes vol. 6 (1994), Amer. Math. Soc., Providence, RI 169-185
53. Tamburini M.C., and Zucca P. Generation of certain matrix groups by three involutions, two of which commute. J. Algebra 195 (1997) 650-661
54. Thomassen C. Tilings of the torus and the klein bottle and vertex-transitive graphs on a fixed surface. Trans. AMS 323 (1991) 605-635
55. Timofeenko A.V. On generating triples of involutions of large sporadic groups. Discrete Math. Appl. 13 (2003) 291-300. http://icm.krasn.ru/refextra.php%3Fid%3D2869 Available at http://icm.krasn.ru/refextra.php?id=2869
56. Valiant L. Graph theoretic properties in computational complexity. J. Comput. System Sci. 13 (1976) 278-285
57. Walther H. Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen. J. Combin. Theory 6 (1969) 1-6 (in German)
58. Wigderson A., and Zuckerman D. Expanders that beat the eigenvalue bound, explicit construction and applications. Proc. of the 25th STOC (1993) 245-251
59. Witte D. Cayley digraphs of prime-power order are Hamiltonian. J. Combin. Theory Ser. B 40 (1986) 107-112
60. Witte D., and Gallian J. A survey: Hamiltonian cycles in Cayley graphs. Discrete Math. 51 (1984) 293-304