Vela

Let be minimal such that, in any two-colouring of the edges of , the edges can be partitioned into vertex disjoint monochromatic copies of (not necessarily the same colour) with at most vertices remaining.Estimate . In particular, is it true that ? Is it true that ?

Worked, still open.

graph theory · solved · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

status

solved

notary

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

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

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

Search Vela

Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.