## Abstract A new proof of Menger's theorem is presented.
A new proof of the 6 color theorem
β Scribed by Oleg V. Borodin
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 579 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
In 1965 Ringel raised a 6 color problem for graphs that can be stated in at least three different forms. In particular, is it possible to color the vertices and faces of every plane graph with 6 colors so that any two adjacent or incident elements are colored differently? This 6 color problem was solved in 1984 by the present author; the proof used about 35 reducible configurations. A shorter new proof is given here using only half as many of reducible configurations. Β© 1995 John Wiley & Sons, Inc.
π SIMILAR VOLUMES
New proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary. Comparison is drawn with the / function which also generates
The simplest known proof of the Map Color Theorem for nonorientable surfaces (obtained by Youngs, Ringel et al. and given in Ringel's book ''Map Color Theorem'') uses index one and three current graphs, and index two and three inductive constructions. We give another proof, still using current graph
Here we give a self-contained new proof of the partial regularity theorems for solutions of incompressible Navier-Stokes equations in three spatial dimensions. These results were originally due to Scheffer and Caffarelli, Kohn, and Nirenberg. Our proof is much more direct and simpler.