Edge-transitive graphs of small order and the answer to a 1967 question by Folkman
Combinatorics
2018-08-17 v1 Group Theory
Abstract
In this paper, we introduce a method for finding all edge-transitive graphs of small order, using faithful representations of transitive permutation groups of small degree, and we explain how we used this method to find all edge-transitive graphs of order up to , and all bipartite edge-transitive graphs of order up to . We also give an answer to a 1967 question of Folkman about semi-symmetric graphs of large valency; in fact we show that for semi-symmetric graphs of order and valency , the ratio can be arbitrarily close to .
Keywords
Cite
@article{arxiv.1808.05319,
title = {Edge-transitive graphs of small order and the answer to a 1967 question by Folkman},
author = {Marston Conder and Gabriel Verret},
journal= {arXiv preprint arXiv:1808.05319},
year = {2018}
}