Paperlane

no. 12 · Tuesday 10 November 2026

Piercing a Chessboard with Restricted Slopes

Giedrius Alkauskas

math.CO · 5 pp

Abstract

Is it true that for $n\geq 3$, $n-1$ lines are needed to pierce every cell of an $n\times n$ board? This problem was independently rediscovered several times: Alkauskas (1998), Harel-Ackerman-Pinchasi (2012, without claiming the $n-1$ bound), Bárány-Frankl (2021). However, apparently the first to pose it was T. Keller (Honolulu, Hawaii), in 1980, in the problem section of The American Mathematical Monthly. In this note, we give an affirmative answer to Keller's problem when all lines have slopes in $(-\infty,-1]\cup(0,1]$.

comments
5 pages, 5 figures
fields
Combinatorics
pdf ↗ page arXiv:2611.12329 ↗