{
  "abstract": "Erdős and Gyárfás conjectured that every graph with minimum degree at least three contains a power-of-two-length cycle. We prove every Cayley graph of odd order satisfies the conjecture. As a corollary, we find that Cayley graphs of finite nilpotent groups satisfy the conjecture as well.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2611.05060",
  "author_total": 1,
  "authors": [
    {
      "name": "Michael C. Burkhart"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/6bavwjs7jqzkp.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2611.05060",
  "fulltext_url": null,
  "id": "6bavwjs7jqzkp",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2611.05060",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.GR"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2611.05060",
  "pmcid": null,
  "pmid": null,
  "published": "2026-11-03",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/6bavwjs7jqzkp.ris",
  "sources": [
    {
      "first_seen": "2026-11-04T15:21:29Z",
      "native_id": "2611.05060",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2611.05060"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.GR",
      "subfield": "algebra-number-theory"
    },
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Odd-ordered Cayley graphs satisfy Erdős--Gyárfás",
  "title_text": "Odd-ordered Cayley graphs satisfy Erdős--Gyárfás",
  "type": "preprint",
  "updated_at": "2026-11-06T18:21:01Z",
  "url": "https://research.draconitic.com/paper/6bavwjs7jqzkp",
  "venue": "arXiv",
  "versions": []
}