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.
β¦ LIBER β¦
A simple proof of Pach's extremal theorem for convex polygons
β Scribed by Godfried T Toussaint
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 83 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-8655
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A simple proof of Moser's theorem
β
Zhu, Xuding
π
Article
π
1999
π
John Wiley and Sons
π
English
β 243 KB
π 2 views
A simple proof of Menger's theorem
β
William McCuaig
π
Article
π
1984
π
John Wiley and Sons
π
English
β 111 KB
π 1 views
## Abstract A proof of Menger's theorem is presented.
A simple proof of Pancharatnam's theorem
β
P.K. Aravind
π
Article
π
1992
π
Elsevier Science
π
English
β 465 KB
A simple proof of A. F. Timan's theorem
β
Heinz-Gerd Lehnhoff
π
Article
π
1983
π
Elsevier Science
π
English
β 189 KB
A simple proof of Gagliardi's handle rec
β
SΓ³stenes Lins
π
Article
π
1985
π
Elsevier Science
π
English
β 430 KB
Recently Gagliardi has proved a theorem on recognizing handles in 3-manifolds crystallizations . The purpose of this note is to present a short proof of this result which follows as a corollary of Theorem 2 and to introduce a more general definition of combinatorial handle, crucial for the proof. W
A simple proof of Gabriel and Popesco's
β
Mitsuhiro Takeuchi
π
Article
π
1971
π
Elsevier Science
π
English
β 61 KB