{"paper":{"title":"The Domination Number of Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre Pinlou, Daniel Gon\\c{c}alves, Michael Rao, St\\'ephan Thomass\\'e","submitted_at":"2011-02-25T10:39:00Z","abstract_excerpt":"In this paper, we conclude the calculation of the domination number of all $n\\times m$ grid graphs. Indeed, we prove Chang's conjecture saying that for every $16\\le n\\le m$, $\\gamma(G_{n,m})=\\lfloor\\frac{(n+2)(m+2)}{5}\\rfloor -4$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5206","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}