Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. Erdos, A. L. Rubin & H. Taylor: Choosability in graphs, Proc. Wes Coast Conference on Combinatorics, Graph Theory and Computing, Congres sus Numerantium 26 (1979), 125–157.
D. Gale & L. S. Shapley: College admissions and the stability of marriage Amer. Math. Monthly 69 (1962), 9–15.
F. Galvin: The list chromatic index of a bipartite multigraph, J. Combinatorial Theory, Ser. B 63 (1995), 153–158.
J. C. M. Janssen: The Dinitz problem solved for rectangles, Bulletin Amer Math. Soc. 29 (1993), 243–249.
V. G. Vizing: Coloring the vertices of a graph in prescribed colours (in Russian), Metody Diskret. Analiz. 101 (1976), 3–10.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2001). The Dinitz problem. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04315-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-04315-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04317-2
Online ISBN: 978-3-662-04315-8
eBook Packages: Springer Book Archive