Monochromatic triangle packings in 2-coloured complete graphs

Abstract: Abstract: We show that every 2-coloured complete graph on n vertices contains $n^2/12 + o(n^2)$ pairwise edge-disjoint monochromatic triangles. This confirms a conjecture of Erdős, and is asymptotically tight. This is joint work with Vytautas Gruslys.

combinatoricsprobability

Audience: researchers in the topic

Extremal and probabilistic combinatorics webinar

Series comments: We've added a password: concatenate the 6 first prime numbers (hence obtaining an 8-digit password).