ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP and QQ be simple polygons with mm and nn sides, respectively, in general position, where m,n≥3m,n\ge 3 are odd. An intersection point is a crossing between a side of PP and a side of QQ.

Odd-sided intersection bound. There are at most

mn−(m+n)+3mn-(m+n)+3

intersection points between sides of PP and sides of QQ.

When both numbers of sides are odd, the parity argument gives the weaker upper bound mn−max⁡{m,n}mn-\max\{m,n\}, while the best known construction achieves mn−(m+n)+3mn-(m+n)+3. The conjecture asserts that this construction is optimal; the status is not established in the supplied source.

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.