https://hackerpaper.kaipfister.de/p/2301.09757/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=35665293urn:hackerpapers:mention:2301.09757:35665293Sat, 22 Apr 2023 11:05:27 GMT<p>https://arxiv.org/abs/2301.09757</p><p><a href="https://hackerpaper.kaipfister.de/p/2301.09757/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DMhttps://news.ycombinator.com/item?id=34673396urn:hackerpapers:mention:2301.09757:34673396Mon, 06 Feb 2023 04:36:39 GMT<p>I think I see what you mean, but it seems to me that you&#x27;re mixing ideas about the chessboard conjecture in this particular context, with more general versions of the conjecture (a bunch of which we don&#x27;t know the answer for, and might be interesting in their own right). In particular, to show that the packing-chromatic number of the infinite grid is 15, we needed to find a finite subgraph of the infinite square grid for which 14 colors are not enough. The class of sub-graphs that seemed more amenable to do this was that of diamonds (i.e., disks in the corresponding metric) of radius r. If…</p><p><a href="https://hackerpaper.kaipfister.de/p/2301.09757/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DM