ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QnQ_n be the nn-dimensional cube graph, whose vertices are binary strings of length nn. For a vertex uu, write uˉ\bar u for the vertex obtained by complementing every bit, and call uu and uˉ\bar u antipodal. An antipodal edge-coloring of QnQ_n is a red/blue edge-coloring in which every pair of antipodal edges has different colors.

Norine's conjecture. For n≥2n\ge 2, any antipodal edge-coloring of QnQ_n contains antipodal vertices uu and uˉ\bar u such that uu and uˉ\bar u are joined by a monochromatic path.

Previous work had proved the conjecture for n≤6n\le 6, and this paper verifies it for n=7n=7 using SAT solvers. The conjecture concerns the existence of a monochromatic connection between antipodal vertices, although the path need not be geodesic.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.