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.
A Proof of Shirshov's Theorem
โ Scribed by Giuseppe Pirillo
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 188 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
โฆ Synopsis
Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas.
Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum.
wJustus Lipsius
In this paper we prove that, except for at most one, all the ranks of a right infinite word which is recurrent and not ultimately periodic are the starting point of an |-division. Using this we give a very simple proof of Shirshov's theorem. We also extend it to not necessarily finite alphabets.
๐ SIMILAR VOLUMES
## Abstract A new proof of Menger's theorem is presented.
## Abstract A proof of Menger's theorem is presented.
Gleason's theorem states that any totally additive measure on the closed subspaces, or projections, of a Hilbert space of dimension greater than two is given by a positive operator of trace class. In this paper we give a constructive proof of that theorem.
In this article, G is a permutation group on a finite set . We write permutations on the right, so that ฮฑg is the image of ฮฑ โ by the action of g โ G. A subset S of is said to be G-regular if the stabilizer g โ G Sg = S is the identity. Our purpose is to give a direct short proof of the following t