Generalized chromatic numbers of random graphs
Abstract
Let p be a hereditary graph property. The p‐chromatic number of a graph is the minimal number of classes in a vertex partition wherein each class spans a subgraph with property p. For the property p of edgeless graphs the p‐chromatic number is just the usual chromatic number, whose value is known to be (1/2 + o(1))n/log2 n for almost every graph of order n. We show that we may associate with every nontrivial hereditary property p an explicitly defined natural number r = r(p), and that the p‐chromatic number is then (l/2r + o(1))n/log2 n for almost every graph of order n. © 1995 John Wiley & Sons, Inc. Copyright © 1995 Wiley Periodicals, Inc., A Wiley Company
Publication Title
Random Structures & Algorithms
Recommended Citation
Bollobás, B., & Thomason, A. (1995). Generalized chromatic numbers of random graphs. Random Structures & Algorithms, 6 (2-3), 353-356. https://doi.org/10.1002/rsa.3240060222
