erdős #76

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

Is it true that in any -colouring of the edges of there must exist at leastmany edge-disjoint monochromatic triangles?

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

graph theory · solved · 0 attempts

Check This Result Yourself

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

OEIS1

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

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 aa0af684e81282e6be5efcc793772ff8015bfadc434b9363fac31c8ab416caa5

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.