Hamiltonian paths in Cayley graphs

نویسندگان

  • Igor Pak
  • Rados Radoicic
چکیده

The classical Lovász conjecture says that every connected Cayley graph is Hamiltonian. We present a short survey of various results in that direction and make some additional observations. In particular, we prove that every finite group G has a generating set of size at most log2 |G|, such that the corresponding Cayley graph contains a Hamiltonian cycle. We also present an explicit construction of 3-regular Hamiltonian expanders.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2-generated Cayley digraphs on nilpotent groups have hamiltonian paths

Suppose G is a nilpotent, finite group. We show that if {a, b} is any 2-element generating set of G, then the corresponding Cayley digraph −−→ Cay(G; a, b) has a hamiltonian path. This implies that all of the connected Cayley graphs of valence ≤ 4 on G have hamiltonian paths.

متن کامل

Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced subgraph of a Cayley graph of any sufficiently large group. Since the 1984 survey of results on ...

متن کامل

Cayley graph associated to a semihypergroup

The purpose of this paper is the study of Cayley graph associated to a semihypergroup(or hypergroup). In this regards first  we associate a Cayley graph to every semihypergroup and then we study theproperties of this graph, such as  Hamiltonian cycles in this  graph.  Also, by some of examples we will illustrate  the properties and behavior of  these Cayley  graphs, in particulars we show that ...

متن کامل

A Hamiltonian Decomposition of 5-star

Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoi...

متن کامل

On trivial ends of Cayley graph of groups

‎In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 309  شماره 

صفحات  -

تاریخ انتشار 2009