Let and be sufficiently large depending on . Is there a graph on vertices with many edges which contains no such that the largest independent set has size at most ?

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

graph theory · solved · possible · 0 attempts

use this data

vela registry pull vfr_37aec80d874a0239
vela reproduce examples/erdos-problems

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 e8808a5e69b5bb992aa61afdec255c64c7940341a6af90db2fc1db9f69c60230

Search Vela

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