ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A bouquet through OO is a finite union C=C1∪⋯∪CnC=C_1\cup\dots\cup C_n of unit circles having the common point OO. For a colouring of R2\mathbb{R}^2, such a bouquet is smiling if some colour occurs on every circle CiC_i but does not occur at OO.

Smiling-bouquet conjecture. For every bouquet CC, every colouring of the plane with finitely many but at least two colours contains a smiling congruent copy of CC.

This conjecture proposes a geometric route toward a human-verifiable proof of the lower bound χ(R2)≥5\chi(\mathbb{R}^2)\geq 5. 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 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.