The smiling-bouquet conjecture
Statement
A bouquet through is a finite union of unit circles having the common point . For a colouring of , such a bouquet is smiling if some colour occurs on every circle but does not occur at .
Smiling-bouquet conjecture. For every bouquet , every colouring of the plane with finitely many but at least two colours contains a smiling congruent copy of .
This conjecture proposes a geometric route toward a human-verifiable proof of the lower bound . The paper presents it as an approach, and no resolution is supplied.
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.