{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreihigmeaznzaotyb55oj4dpe43azzdcwm7ht55rzkl4bu7h5g7pn5q",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mephfl5ny7u2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2602.10559v1",
  "publishedAt": "2026-02-12T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Guangyan Zhou"
  ],
  "textContent": "**Authors:** Guangyan Zhou\n\nWe study the algorithmic decidability of the domination number in the Erdos-Renyi random graph model $G(n,p)$. We show that for a carefully chosen edge probability $p=p(n)$, the domination problem exhibits a strong irreducible property. Specifically, for any constant $0",
  "title": "Self-referential instances of the dominating set problem are irreducible"
}