<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Domination Number of Grids · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1102.5206/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1102.5206/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Domination Number of Grids — mentioned by robinhouston</title><link>https://news.ycombinator.com/item?id=24213936</link><guid isPermaLink="false">urn:hackerpapers:mention:1102.5206:24213936</guid><pubDate>Wed, 19 Aug 2020 18:18:47 GMT</pubDate><description>&lt;p&gt;It turns out that the answer to this question is known for all sizes of grid[1], though it was found fairly recently (2011) and the answer for small grids is quite complicated. For the 9x4 grid, the optimal number is indeed 10. For large n×m grids, with n and m ≥ 16, the minimum number is: floor((n + 2)(m + 2) / 5) - 4. The linked paper has a full-page table giving the formulae for small grids. Thanks to Schoolmeister for mentioning the name of this problem, which gave me the right terms to search for. 1. https://arxiv.org/abs/1102.5206&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1102.5206/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DM</category></item></channel></rss>
