The bounded-side conjecture for cells in BC(2,n)
Statement
Let be the stained-glass graph obtained from a rectangle by the construction described in the paper, and call the bounded regions of this graph cells. Bounded-side conjecture. The cells in have at most eight sides, and for they have at most six sides. The claim is motivated by the fact that the analogous cells in 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.