scientific article; zbMATH DE number 1564003

MaRDI QIDQ4528824zbMATH OpenFDO

Authors Alexander Samokhin

Publication date 12 February 2001

zbMATH Keywords

Euler formulafour-color theorem

Mathematics Subject Classification ID

Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Coloring of graphs and hypergraphs (05C15)

Review text

The author introduces basic notions of graph theory and proves that each planar graph is 5-colorable. He formulates the well-known four-color theorem which asserts that every loopless planar graph is 4-colorable, presents several equivalent formulations for it, outlines the history of its proof, given in 1977 by Appel and Haken, and discusses what a mathematical proof is. The article is based on a lecture given by the author for secondary school teachers in the framework of the ``International Soros Science Educational Program and is aimed at presenting contemporary developments in mathematics on an elementary level understandable for secondary school teachers and pupils.

Recommendations

• The four-colour theorem
• scientific article; zbMATH DE number 1021588
• scientific article; zbMATH DE number 4160756
• scientific article; zbMATH DE number 866017
• scientific article; zbMATH DE number 3891395

Cited in

(6)

• The four-colour theorem
• scientific article; zbMATH DE number 3891395 (Why is no real title available?)
• scientific article; zbMATH DE number 4160756 (Why is no real title available?)
• The Four Colour Theorem: Engineering of a Formal Proof
• scientific article; zbMATH DE number 1021588 (Why is no real title available?)
• scientific article; zbMATH DE number 1099607 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4528824)