ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let BC(2,n)BC(2,n) be the stained-glass graph obtained from a 2×n2\times n rectangle by the construction described in the paper, and call the bounded regions of this graph cells. Bounded-side conjecture. The cells in BC(2,n)BC(2,n) have at most eight sides, and for n≥19n\geq 19 they have at most six sides. The claim is motivated by the fact that the analogous cells in BC(1,n)BC(1,n) are always triangles or quadrilaterals, but it remains unproved according to the supplied text.

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.