Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3 u(u - 1)(u - 2) | for n = 2u 2/3 u(u - 1)(4u + 1) | for n = 4u + 1 2/3 u(u + 1)(4u - 1) | for n = 4u + 3. auto right match The first few numbers of monochromatic forced triangles are 0, 0, 0, 0, 0, 2, 4, 8, 12, 20, 28, 40, ... (OEIS A014557).

complete graph | extremal graph