erdős #22
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 ?
unreviewedOpen. Worked here; no verified result yet.
graph theory · solved · possible · 0 attempts
use this data
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsConnections1
Create a formalisation here · link
Check it yourself
One command re-derives this record's receipts on your machine.
vela reproduce examples/erdos-problems