On vertex transitive graphs of infinite degree
✍ Scribed by R. Diestel; H. A. Jung; R. G. Möller
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 816 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0003-889X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We give a necessary and suflicient exactly one vertex of infinite degree. condition for the existence of a l-factor in graphs with ## 1. Illmmdon The following well-known necessary and sufficient condition for the existence of a l-factor in locally
## Abstract Let __n__ be an integer and __q__ be a prime power. Then for any 3 ≤ __n__ ≤ __q__−1, or __n__=2 and __q__ odd, we construct a connected __q__‐regular edge‐but not vertex‐transitive graph of order 2__q__^__n__+1^. This graph is defined via a system of equations over the finite field of
## Abstract In 1983, the second author [D. Marušič, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers __n__ there exists a non‐Cayley vertex‐transitive graph on __n__ vertices. (The term __non‐Cayley numbers__ has later been given to such integers.) Motivated by this problem,
## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra