Edge Coloring Complete
Discrete Mathematics
Level
2
What is the minimal number \(k\) such that there exists a proper edge coloring of the complete graph on 8 vertices with \(k\) colors?
by
Henry Maltby