ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be an integral orthogonal polygon, meaning that all its edges have integer length, and let NN be its perimeter. The N/6N/6 guard conjecture. The polygon PP can always be guarded with at most

⌊N6⌋\left\lfloor \frac{N}{6} \right\rfloor

guards. The best bound established in the paper is ⌊N/5⌋\lfloor N/5\rfloor, while the conjectured N/6N/6 bound is motivated by integral versions of orthogonal comb polygons requiring N/6N/6 guards and remains 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 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.