Abstract
We study the set chromatic number of a random graph \(\mathcal{G}(n,p)\) for a wide range of p = p(n). We show that the set chromatic number, as a function of p, forms an intriguing zigzag shape.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
G. Chartrand, F. Okamoto, C.W. Rasmussen, and P. Zhang, “The set chromatic number of a graph”, Discuss. Math. Graph Theory, 29 (2009), 545–561.
R. Gera, F. Okamoto, C. Rasmussen, and P. Zhang, “Set colorings in perfect graphs”, Math. Bohem. 136 (2011), 61–68.
T. Łuczak, “The chromatic number of random graphs”, Combinatorica 11 (1) (1991), 45–54.
C. McDiarmid, “On the chromatic number of random graphs”, Random Structures & Algorithms 1 (4) (1990), 435–442.
J.S. Sereni, Z. Yilma, “A tight bound on the set chromatic number”, Discuss. Math. Graph Theory, 33 (2013), 461–465.
Acknowledgements
Project sponsored by the National Security Agency under Grant Number H98230-15-1-0172 (the United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon). The research of the third author is supported in part by NSERC and Ryerson University.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Dudek, A., Mitsche, D., Prałat, P. (2017). The Set Chromatic Number of Random Graphs. In: Díaz, J., Kirousis, L., Ortiz-Gracia, L., Serna, M. (eds) Extended Abstracts Summer 2015. Trends in Mathematics(), vol 6. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-51753-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-51753-7_4
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-51752-0
Online ISBN: 978-3-319-51753-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)