Exact three-column constellation conjecture
Statement
Let be the largest number of points in an by regular grid such that no three selected points form an isosceles triangle of nonzero area. Three-column exact-value conjecture. For ,
and
The preceding lemma establishes the corresponding lower bounds, but the supplied text gives no matching upper-bound proof or resolution, so the exact-value conjecture remains open here.
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.