The four-colour theorem is one of the famous problems of mathematics, that frustrated generations of mathematicians from its birth in 1852 to its solution (using substantial assistance from electronic computers) in 1976. The theorem asks whether four colours are sufficient to colour all conceivable maps, in such a way that countries with a common border are coloured with different colours. The book discusses various attempts to solve this problem, and some of the mathematics which developed out of these attempts. Much of this mathematics has developed a life of its own, and forms a fascinating part of the subject now known as graph theory. The book is designed to be self-contained, and develops all the graph-theoretical tools needed as it goes along. It includes all the elementary graph theory that should be included in an introduction to the subject, before concentrating on specific topics relevant to the four-colour problem. Part I covers basic graph theory, Euler's polyhedral formula, and the first published false proof of the four-colour theorem. Part II ranges widely through related topics, including map-colouring on surfaces with holes, the famous theorems of Kuratowski, Vizing, and Brooks, the conjectures of Hadwiger and Hajos, and much more besides. In Part II we return to the four-colour theorem, and study in detail the methods which finally cracked the problem.
Populaire auteurs
Cram101 Textbook Reviews (948) J.S. Bach (447) Wolfgang Amadeus Mozart (305) Collectif (268) Schrijf als eerste een recensie over dit item (259) Doug Gelbert (238) Princess of Patterns (211) Charles Dickens (209) R.B. Grimm (197) Carolyn Keene (187) Jules Verne (183) Philipp Winterberg (180) William Shakespeare (174) Youscribe (172) Lucas Nicolato (169) Edgar Allan Poe (166) Herman Melville (166) Anonymous (165) Gilad Soffer (164) Robert Louis Stevenson (159)Populaire gewichtsboeken
418 KB 425 KB 435 KB 459 KB 445 KB 439 KB 386 KB 413 KB 493 KB 432 KB 455 KB 471 KB 421 KB 451 KB 485 KB 472 KB 416 KB 369 KB 419 KB 427 KB