On the chromatic number of rational five-space
β Scribed by Kiran B. Chilakamarri
- Publisher
- Springer
- Year
- 1990
- Tongue
- English
- Weight
- 127 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0001-9054
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The mean chromatic number of a graph is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. Some results on the value of the mean chromatic number and its asymptotic behaviour are presented.
We compute the rational Betti numbers of the configuration space C k (M) of k points in an evendimensional orientable closed manifold M and prove that these numbers depend only on the rational cohomology algebra of the manifold. We give also a formula for the Euler-PoincarΓ© characteristic of C k (M)
Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their