{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiaza4qfrrn3w4gmawfs2wciidixbmerss42s27p3yguofajqorire",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mfsu27vv45n2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.23000v1",
  "publishedAt": "2026-02-27T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Clément Carbonnel"
  ],
  "textContent": "**Authors:** Clément Carbonnel\n\nWe show that the existence of a homomorphism from an $n$-vertex graph $G$ to an $h$-vertex graph $H$ can be decided in time $2^{O(n)}h^{O(1)}$ and polynomial space if $H$ comes from a family of graphs that excludes a topological minor. The algorithm is based on a reduction to a single-exponential number of constraint satisfaction problems over tractable languages and can handle cost minimization. We also present an improved randomized algorithm for the special case where the graph $H$ is an odd cycle.",
  "title": "Faster algorithms for graph homomorphism via tractable constraint satisfaction"
}