A Beautiful Proof by Induction
2016 (English)In: Journal of Humanistic Mathematics, ISSN 2159-8118, E-ISSN 2159-8118, Vol. 6, no 1Article in journal (Refereed) Epub ahead of print
The purpose of this note is to present an example of a proof by induction that in the opinion of the present author has great aesthetic value. The proof in question is Thomassen’s proof that planar graphs are 5-choosable. I give a self-contained presentation of this result and its proof, and a personal account of why I think this proof is beautiful.
A secondary purpose is to more widely publicize this gem, and hopefully make it part of a standard set of examples for examining characteristics of proofs by induction.
Place, publisher, year, edition, pages
Digital Commons , 2016. Vol. 6, no 1
Research subject Mathematics
IdentifiersURN: urn:nbn:se:umu:diva-118552DOI: 10.5642/jhummath.201601.06OAI: oai:DiVA.org:umu-118552DiVA: diva2:914005