ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For all sufficiently large nn, every coloring C:(Fin⁡(n)2)→{0,1}C:\binom{\operatorname{Fin}(n)}{2}\to\{0,1\} of the edges of the complete graph on Fin⁡(n)\operatorname{Fin}(n) has at most n2/4n^2/4 edges that do not lie in a monochromatic triangle. Equivalently, the set of unordered non-diagonal pairs ee such that, whenever e={x,y}e=\{x,y\}, there is no vertex z≠x,yz\neq x,y with C({x,z})=C(e)=C({y,z})C(\{x,z\})=C(e)=C(\{y,z\}) has cardinality at most n2/4n^2/4.

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.