The three-color conjecture for weak conflict-free vertex-to-vertex guarding
Statement
A simple polygon is a polygonal region whose boundary is a simple polygonal curve. In weak conflict-free vertex-to-vertex chromatic guarding, guards are placed at polygon vertices and a vertex is guarded when it sees a guard of a color that no other visible guard has.
Three-color guarding conjecture. Every simple polygon admits a weak conflict-free vertex-to-vertex chromatic guarding with at most colors.
This conjecture concerns the number of colors needed for weak conflict-free visibility guarding. The source presents it as a suggestion from investigation rather than as a proved result; its resolution is left open.
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.