Elusive groups of automorphisms of digraphs of small valency

Michael Giudici; Luke Morgan; P. Potočnik; Gabriel Verret

doi:10.1016/j.ejc.2014.11.004

Elusive groups of automorphisms of digraphs of small valency

Michael Giudici, Luke Morgan, P. Potočnik, Gabriel Verret

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

Abstract

© 2014 Elsevier Ltd. A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.

Original language	English
Pages (from-to)	1-9
Journal	European Journal of Combinatorics
Volume	46
DOIs	https://doi.org/10.1016/j.ejc.2014.11.004
Publication status	Published - May 2015

Access to Document

10.1016/j.ejc.2014.11.004

http://arxiv.org/abs/1405.1228

Cite this

@article{b6340a0103a046c1ab1943d2f3480317,

title = "Elusive groups of automorphisms of digraphs of small valency",

abstract = "{\textcopyright} 2014 Elsevier Ltd. A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.",

author = "Michael Giudici and Luke Morgan and P. Poto{\v c}nik and Gabriel Verret",

year = "2015",

month = may,

doi = "10.1016/j.ejc.2014.11.004",

language = "English",

volume = "46",

pages = "1--9",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

}

TY - JOUR

T1 - Elusive groups of automorphisms of digraphs of small valency

AU - Giudici, Michael

AU - Morgan, Luke

AU - Potočnik, P.

AU - Verret, Gabriel

PY - 2015/5

Y1 - 2015/5

N2 - © 2014 Elsevier Ltd. A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.

AB - © 2014 Elsevier Ltd. A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.

U2 - 10.1016/j.ejc.2014.11.004

DO - 10.1016/j.ejc.2014.11.004

M3 - Article

SN - 0195-6698

VL - 46

SP - 1

EP - 9

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

ER -

Elusive groups of automorphisms of digraphs of small valency

Abstract

Access to Document

Fingerprint

Cite this