{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreicgekmncjfgdvv2w5h3a6efppiqcnisf2dpgdj3zxdyoznes6f3g4",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mefmk4abkme2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.06874v1",
  "publishedAt": "2026-02-09T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Maria Chudnovsky",
    "Ilya Maier"
  ],
  "textContent": "**Authors:** Maria Chudnovsky, Ilya Maier\n\nLet $G$ be a graph and let $\\mathrm{cl}(G)$ be the number of distinct induced cycle lengths in $G$. We show that for $c,t\\in \\mathbb N$, every graph $G$ that does not contain an induced subgraph isomorphic to $K_{t+1}$ or $K_{t,t}$ and satisfies $\\mathrm{cl}(G) \\le c$ has bounded treewidth. As a consequence, we obtain a polynomial-time algorithm for deciding whether a graph $G$ contains induced cycles of at least three distinct lengths.",
  "title": "Induced Cycles of Many Lengths"
}