Este repositorio contiene el código fuente de la presentación:
Curso: Introducción a la matemática discreta CM-254.
Profesor: MSc. Ronald Mas Huaman.
Asesor: MSc. Fidel Jara Huanca.
Fecha: 18 de junio del 2018.
Aula: R1 - 401.
- Oromion Aznarán.
- Franss Cruz.
- José Navío.
- Gabriel Quiroz.
La presente presentación trata sobre la historia del teorema de los cuatro colores.
- Introducción
- Acontecimientos importantes en la historia del teorema
- Aplicaciones
- Conclusiones
[1] Appel, Kenneth, and Wolfgang Haken. 1977. “The Solution of the Four-Color-Map Problem.” Scientific American 237 (4). Scientific American, a division of Nature America, Inc.: 108–21.
[2] Birkhoff, George D. 1913. “The Reducibility of Maps.” American Journal of Mathematics 35 (2). Johns Hopkins University Press: 115–28.
[3] Combinatorics, and Optimization University of Waterloo. 2017a. “SiGMa 2017 László Miklós Lovász, Extremal Graph Theory and Finite Forcibility.” https://www.youtube.com/watch?v=OfPf4qA1x_k.
[4] “SiGMa 2017 Paul Seymour, Rainbow Induced Paths in Graphs with Large Chromatic and Small Clique Number.” https://www.youtube.com/watch?v=CnxmwDuYpX8.
[5] Fritsch, Rudolf, and Gerda Fritsch. 1998. The Four-Color Theorem: History, Topological Foundations, and Idea of Proof. Springer.
[6] Kempe, Alfred Bray. 1879. “On the Geographical Problem of the Four Colours.” American Journal of Mathematics 2 (3). Johns Hopkins University Press: 193–200.
[7] Matoušek, Jiří, and Jaroslav Nešetřil. 2009. Invitation to Discrete Mathematics. Oxford University Press.
[8] Robertson, Neil, Daniel Sanders, Paul Seymour, and Robin Thomas. 1997. “The Four-Colour Theorem.” Journal of Combinatorial Theory, Series B 70 (1). Elsevier: 2–44.
[9] Thomas, Robin. 1995. “The Four Color Theorem.” http://people.math.gatech.edu/~thomas/FC/.
[10] Vilfred Kamalappan, V. 2017. “The Four Color Theorem: A New Proof by Induction.”
Licencia bajo GPL V2
Las diapositivas compiladas: pdf.