Any 3-coloring of a 493 by 493 integer grid must contain a monochromatic L-shape, improving the previous upper bound of 2593.
Manske, Coloring in Extremal Problems in Combinatorics , Iowa State University, Ames, 2010
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Ramsey Theory on the Integer Grid: The "L" Problem
Any 3-coloring of a 493 by 493 integer grid must contain a monochromatic L-shape, improving the previous upper bound of 2593.