✦ 5 frontiers

read-only vieweressays

erdős #76

← #75 · #77 → (packet.json; erdosproblems.com)

Is it true that in any $2$ -colouring of the edges of $K_{n}$ there must exist at least $(1 + o (1)) \frac{n ^{2}}{12}$ many edge-disjoint monochromatic triangles?

Worked, still open.

graph theory · solved · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

oeis

A060407 — Maximal number of pairwise edge-disjoint monochromatic K_3's in a K_n for any 2-coloring of the edges of K_n.0,0,0,1,2,2,3,4,6

links

Create a formalisation here · link

status

solved

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub