Erdős's monochromatic triangle packing conjecture
Statement
Let be the complete graph on vertices whose edges are coloured with two colours. A collection of triangles is pairwise edge-disjoint if no edge belongs to more than one triangle. Erdős's conjecture. Every -coloured contains pairwise edge-disjoint monochromatic triangles. This conjecture asks for the asymptotically sharp guaranteed size of a monochromatic triangle packing in every two-edge-colouring of a complete graph; the paper's abstract says that it confirms the conjecture.
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.