Erdős Problem #639 — Uncovered Edges in Two-Colored Complete Graphs
Statement
For all sufficiently large , every coloring of the edges of the complete graph on has at most edges that do not lie in a monochromatic triangle. Equivalently, the set of unordered non-diagonal pairs such that, whenever , there is no vertex with has cardinality at most .
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.