Vela

Let . Is there a constant such that, for all large , every graph on vertices with at least edges must contain a subgraph on at most vertices which is non-planar?

Worked, still open.

graph theory · solved · 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 c54f38179a27ecdfcf21cffa9d8cb82e2c551cfdedb89b0a221f43ebe33937c1

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.