{"database": "team-science", "table": "adjacent_pair", "rows": [["ap-b13aab4679", "problem", "se-cstheory-791", "Grid $k$-coloring without monochromatic rectangles. Update : The obstruction set (i.e. the NxM \"barrier\" between colorable and uncolorable grid sizes) for all monochromatic-rectangle-free 4-colorings is now known . Anyone feel up to trying 5-colorings? ;) The following question arises out of Ramsey ", "problem", "se-mo-514742", "Is the square achievement game on the $n \u00d7 n$ grid resolved for $6 \\le n \\le 14$? In the square achievement game , two players alternately mark unoccupied cells of an $n \\times n$ grid. The first player to own four cells at the vertices of a square with horizontal and vertical sides wins; if the boa", "four cells", "adjacent-field", "novel", "0 ingested paper titles mention both sides (text proxy for #177 pair-novelty)", "answered", "ts-synth", "2026-09-02T18:02:06Z", null, null, null, null, null]], "columns": ["id", "a_kind", "a_ref", "a_label", "b_kind", "b_ref", "b_label", "bridge", "distance", "novelty", "evidence", "status", "asked_by", "created_ts", "signal", "score", "why", "prompt", "reading"], "primary_keys": ["id"], "primary_key_values": ["ap-b13aab4679"], "units": {}, "query_ms": 0.5446309223771095, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}