adjacent_pair: ap-b13aab4679
Data license: Space charter; records cite primary sources · Data source: TeamScience Space repository
This data as json
| 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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 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 × 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 |
Links from other tables
- 1 row from pair_id in pair_answer