## 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,
Infinite families of non-Cayley vertex-transitive tournaments
✍ Scribed by Sònia P. Mansilla
- Book ID
- 108113488
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 253 KB
- Volume
- 288
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In 1983, D. Maru~ifi initiated the determination of the set NC of non-Cayley numbers. A number n belongs to NC if there exists a vertex-transitive, non-Cayley graph of order n. The status of all non-square-free numbers and the case when n is the product of two primes was settled recently by B.D. McK
## 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
This paper completes the determination of all integers of the form pqr (where p, q, and r are distinct primes) for which there exists a vertex-transitive graph on pqr vertices which is not a Cayley graph.