✦ LIBER ✦
A ramsey-theoretic result involving chromatic numbers
✍ Scribed by Stefan A. Burr
- Publisher
- John Wiley and Sons
- Year
- 1980
- Tongue
- English
- Weight
- 89 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The following result is proved. A graph G can be expressed as the edge‐disjoint union of k graphs having chromatic numbers no greater than m~1~,…,m~k~, respectively, iff χ(G) ≤ m~1~…m~k~.