ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn 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 22-coloured KnK_n contains n2/12+o(n2)n^2/12 + o(n^2) 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 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.