๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple proof of Moser's theorem

โœ Scribed by Zhu, Xuding


Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
243 KB
Volume
30
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


Simple proof of the pairing theorem
โœ I. Mayer ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 112 KB ๐Ÿ‘ 1 views

A very simple constructive proof of Lowdin's pairing theorem is presented.

A quick proof of Riemann's mapping theor
โœ H. P. McKean ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 278 KB ๐Ÿ‘ 1 views
A short proof of K๏ฟฝnig's matching theore
โœ Rizzi, Romeo ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 43 KB ๐Ÿ‘ 2 views

We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.

A short proof of a theorem on Hamiltonia
โœ Ainouche, A. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 219 KB ๐Ÿ‘ 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

A new proof of the Caffarelli-Kohn-Niren
โœ Fanghua Lin ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 220 KB ๐Ÿ‘ 1 views

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.