Digraphs admitting sharply edge-transitive automorphism groups (Q1101461)

A permutation group G on a set X is a sharply edge-transitive group (SETG) if there exists a directed graph (X,R) such that \(G\leq Aut(X,R)\) and G acts as a regular permutation group on R. Let \(K^ h_ m\) denote the directed graph whose vertex set is partitioned into h disjoint m-sets and any two vertices in distinct m-sets are joined in both directions. Together with \textit{L. Babai}, \textit{M. Deza}, and \textit{N. M. Singhi} [J. Algebra 73, 573-585 (1981; Zbl 0475.05042)], the author posed the problem of determining the maximum valence d(n) of a directed graph on m vertices admitting a SETG. Since d(hm) is often realized by the graphs \(K^ h_ m\), this paper is largely devoted to finding (mostly) necessary conditions (in general, number-theoretical conditions upon h and m) for \(K^ h_ m\) to admit a SETG.