{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:05:06Z","timestamp":1758823506134,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A Frobenius group is a transitive permutation group that is not regular and such that only the identity fixes more than one point. A digraphical, respectively graphical, Frobenius representation, DFR and GFR for short, of a Frobenius group $F$ is a digraph, respectively graph, whose automorphism group as a group of permutations of the vertex set is $F$. The problem of classifying which Frobenius groups admit a DFR and GFR has been proposed by Mark Watkins and Thomas Tucker and is a natural extension of the problem of classifying which groups that have a digraphical, respectively graphical, regular representation.In this paper, we give a partial answer to a question of Mark Watkins and Thomas Tucker concerning Frobenius representations: \"All but finitely many Frobenius groups with a given Frobenius complement have a DFR\".\u00a0\u00a0<\/jats:p>","DOI":"10.37236\/7097","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T15:35:08Z","timestamp":1578670508000},"source":"Crossref","is-referenced-by-count":9,"title":["On the Existence of Frobenius Digraphical Representations"],"prefix":"10.37236","volume":"25","author":[{"given":"Pablo","family":"Spiga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2018,4,3]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p6\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v25i2p6\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:34:59Z","timestamp":1579235699000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v25i2p6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,3]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,4,13]]}},"URL":"https:\/\/doi.org\/10.37236\/7097","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2018,4,3]]},"article-number":"P2.6"}}