{
  "abstract": "We study the strict and monotone $(1:b)$ Avoider--Enforcer games on the edges of the complete graph $K_n$. We prove that, for integers $n\\ge2$ and $b\\ge6n$, Avoider can keep his graph a forest after every move, except possibly the last. Thus, his final graph contains at most one cycle. This answers Question~10 of Clemens, Ehrenmüller, Person, and Tran, which asks whether a bias linear in $n$ is sufficient.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.29522",
  "author_total": 1,
  "authors": [
    {
      "name": "Jovana Forcan"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0ptp66yphks0g.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.29522",
  "fulltext_url": null,
  "id": "0ptp66yphks0g",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.29522",
  "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"
    ],
    [
      "openalex",
      "2607|Limits and Structures in Graph Theory"
    ]
  ],
  "openalex": "W7223221386",
  "pdf_url": "https://arxiv.org/pdf/2610.29522",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-21",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0ptp66yphks0g.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:34:22Z",
      "native_id": "2610.29522",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.29522"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Avoiding two cycles in Avoider--Enforcer games",
  "title_text": "Avoiding two cycles in Avoider--Enforcer games",
  "type": "preprint",
  "updated_at": "2026-10-30T12:34:22Z",
  "url": "https://research.draconitic.com/paper/0ptp66yphks0g",
  "venue": "arXiv",
  "versions": []
}