The four-color problem was a main driving force for the development of graph theory as we know it today, and coloring is still a topic that many graph theorists like best. Here is a simple-sounding coloring problem, raised by Jeff Dinitz in 1978, which defied all attacks until its astonishingly simple solution by Fred Galvin fifteen years later.
CITATION STYLE
Aigner, M., & Ziegler, G. M. (2018). The Dinitz problem. In Proofs from THE BOOK (pp. 271–276). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-57265-8_38
Mendeley helps you to discover research relevant for your work.