Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.02474 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911977452863488 |
|---|---|
| author | Frankston, Keith Scheinerman, Danny |
| author_facet | Frankston, Keith Scheinerman, Danny |
| contents | We say a red/blue edge-coloring of the $n$-dimensional cube graph, $Q_n$, is antipodal if all pairs of antipodal edges have different colors. Norine conjectured that in such a coloring there must exist a pair of antipodal vertices connected by a monochromatic path. Previous work has proven this conjecture for $n\le 6$. Using SAT solvers we verify that the conjecture holds for $n = 7$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_02474 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Proving Norine's Conjecture holds for $n=7$ via SAT solvers Frankston, Keith Scheinerman, Danny Combinatorics We say a red/blue edge-coloring of the $n$-dimensional cube graph, $Q_n$, is antipodal if all pairs of antipodal edges have different colors. Norine conjectured that in such a coloring there must exist a pair of antipodal vertices connected by a monochromatic path. Previous work has proven this conjecture for $n\le 6$. Using SAT solvers we verify that the conjecture holds for $n = 7$. |
| title | Proving Norine's Conjecture holds for $n=7$ via SAT solvers |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.02474 |