{
  "id": "1608.07749",
  "version": "v1",
  "published": "2016-08-27T22:56:00.000Z",
  "updated": "2016-08-27T22:56:00.000Z",
  "title": "Odd extensions of transitive groups via symmetric graphs",
  "authors": [
    "Klavdija Kutnar",
    "Dragan Marusic"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely: when is it that existence of automorphisms acting as even permutations on the vertex set of a graph, called {\\em even automorphisms}, forces existence of automorphisms that act as odd permutations, called {\\em odd automorphisms}. As a first step towards resolving the above question, a complete information on existence of odd automorphisms in cubic symmetric graphs is given.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-08-27T22:56:00.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C25",
      "20B25"
    ],
    "keywords": [
      "odd extensions",
      "transitive groups",
      "odd automorphisms",
      "even/odd permutations dichotomy",
      "cubic symmetric graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}