{
  "id": "2002.10639",
  "version": "v1",
  "published": "2020-02-25T03:09:58.000Z",
  "updated": "2020-02-25T03:09:58.000Z",
  "title": "On free products of graphs",
  "authors": [
    "Max Carter",
    "Stephan Tornier",
    "George A. Willis"
  ],
  "comment": "17 pages",
  "categories": [
    "math.GR",
    "math.CO"
  ],
  "abstract": "We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free product to be as large as possible, and we give sufficient criteria for it to be non-discrete. Finally, we transfer Tits' classification of automorphisms of trees and simplicity criterion to free products of graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-02-25T03:09:58.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C25",
      "22D05"
    ],
    "keywords": [
      "free product",
      "simplicity criterion",
      "transfer tits",
      "connected simple graphs",
      "sufficient criteria"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 17,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}