Volume 34, Numbers 2-3, 265-281, DOI: 10.1007/s10623-004-4859-2

Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order

Ákos Seress

View Related Documents

Abstract

A complete classification is given of finite primitive permutation groups which contain a regular subgroup of square-free order. Then a collection PNC{\cal P}{\cal N}{\cal C} of square-free numbers n is obtained such that there exists a vertex-primitive non-Cayley graph on n vertices if and only if n is a member of PNC{\cal P}{\cal N}{\cal C} .

Fulltext Preview

Image of the first page of the fulltext document