𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Chromatic numbers of metric spaces
✍ A. M. Raigorodskii πŸ“‚ Article πŸ“… 2008 πŸ› Springer US 🌐 English βš– 112 KB
On the mean chromatic number
✍ Martin Anthony πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 209 KB

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.

On the chromatic number of ℝ9
✍ A. B. Kupavskii; A. M. Raigorodskii πŸ“‚ Article πŸ“… 2009 πŸ› Springer US 🌐 English βš– 165 KB
Rational Betti numbers of configuration
✍ Yves FΓ©lix; Jean-Claude Thomas πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 105 KB

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)

On the chromatic number of disk graphs
✍ Malesi?ska, Ewa; Piskorz, Steffen; WeiοΏ½enfels, Gerhard πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 2 views

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