𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regularities on the Cayley Graphs of Groups of Linear Growth

✍ Scribed by Roberto Incitti

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
197 KB
Volume
18
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper a short proof is given of a theorem of M . Gromov in a particular case using a combinatorial argument .

📜 SIMILAR VOLUMES

On the Isomorphisms of Cayley Graphs of
On the Isomorphisms of Cayley Graphs of Abelian Groups
✍ Yan-Quan Feng; Yan-Pei Liu; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Let G be a finite group, S a subset of G=f1g; and let Cay ðG; SÞ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayðG; SÞ ffi CayðG; T Þ implies that S a ¼ T for some a 2 AutðGÞ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene

Expansion Properties of Cayley Graphs of
Expansion Properties of Cayley Graphs of the Alternating Groups
✍ Yuval Roichman 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Let C be a conjugacy class in the alternating group A n , and let supp(C) be the number of nonfixed digits under the action of a permutation in C. For every 1>$>0 and n 5 there exists a constant c=c($)>0 such that if supp(C) $n then the undirected Cayley graph X(A n , C) is a c expander. A family of

Hamiltonian Decompositions of Cayley Gra
Hamiltonian Decompositions of Cayley Graphs on Abelian Groups of Odd Order
✍ Jiuqiang Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 380 KB

Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a

The Growth of Linear Groups
The Growth of Linear Groups
✍ Yehuda Shalom 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 124 KB

We present a short, self-contained, relatively simple proof to the growth dichotomy of linear groups. The proof depends on the fixed point property of amenable groups, and the main tool is Furstenberg's Lemma regarding measures on projective spaces.

Hamilton cycle and Hamilton path extenda
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups
✍ Štefko MiklaviČ; Primož Šparl 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is __weakly n__‐__HP‐

One-factorizations of complete graphs wi
One-factorizations of complete graphs with vertex-regular automorphism groups
✍ Arrigo Bonisoli; Domenico Labbate 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun