A Simple Proof of the Four-Color Theorem

Simple item page
dc.creatorAlhargan, Fayez A.
dc.date2002-07-06
dc.date.accessioned2026-07-07T04:49:34Z
dc.date.available2026-07-07T04:49:34Z
dc.descriptionA simpler proof of the four color theorem is presented. The proof was reached using a series of equivalent theorems. First the maximum number of edges of a planar graph is obatined as well as the minimum number of edges for a complete graph. Then it is shown that for the theorem to be false there must exist a complete planar graph of $h$ edges such that $h>4$. Finally the theorem is proved to be true by showing that there does not exist a complete planar graph with $h>4$.
dc.description4pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0207061
dc.identifierhttp://arxiv.org/abs/math/0207061
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64468
dc.subjectGeneral Mathematics
dc.subject54C99
dc.titleA Simple Proof of the Four-Color Theorem
dc.typetext

Files

Collections

arXiv