Premium
A ramsey‐theoretic result involving chromatic numbers
Author(s) -
Burr Stefan A.
Publication year - 1980
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190040212
Subject(s) - mathematics , combinatorics , chromatic scale , ramsey's theorem , disjoint sets , graph , discrete mathematics
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 .