Description
This talk will outline the problem of determining all edge-transitive graphs on 3n vertices admitting a symmetry which acts on the vertices in three cycles of length n. We show the nine feasible diagrams and show how considerations of toroidal maps can give us an easy elimination of four of the nine. Two others have a more difficult elimination whose difficulties we will ignore. We end by showing nearly proven conjectures about the remaining three diagrams.
Primary author
Prof.
Steve WILSON
(University of Primorska)
