No label defined (Q4528824)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1564003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1564003 |
Statements
12 February 2001
0 references
Euler formula
0 references
four-color theorem
0 references
0.8734538555145264
0 references
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.
0 references
