This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.
Simple proof of the pairing theorem
β Scribed by I. Mayer
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 112 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0020-7608
No coin nor oath required. For personal study only.
β¦ Synopsis
A very simple constructive proof of Lowdin's pairing theorem is presented.
π SIMILAR VOLUMES
## Abstract For blockβpartitioned matrices of the __GI/M/__1 type, it has been shown by M. F. Neuts that the stationary probability vector, when it exists, has a matrixβgeometric form. We present here a new proof, which we believe to be the simplest available today.
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.
We give a simple proof of an occupancy tail bound in the balls and bins experiment using the method of bounded differences in expected form. We also indicate how a short, calculation-free proof of another occupancy tail bound follows from an extension of the standard ChernoffαHoeffding bounds to var