Clique coloring of binomial random graphs. Issue 4 (12th November 2018)
- Record Type:
- Journal Article
- Title:
- Clique coloring of binomial random graphs. Issue 4 (12th November 2018)
- Main Title:
- Clique coloring of binomial random graphs
- Authors:
- McDiarmid, Colin
Mitsche, Dieter
Prałat, Paweł - Abstract:
- Abstract : A clique coloring of a graph is a coloring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colors in such a coloring is the clique chromatic number. In this paper, we study the asymptotic behavior of the clique chromatic number of the random graph 𝒢( n, p ) for a wide range of edge‐probabilities p = p ( n ). We see that the typical clique chromatic number, as a function of the average degree, forms an intriguing step function.
- Is Part Of:
- Random structures & algorithms. Volume 54:Issue 4(2019)
- Journal:
- Random structures & algorithms
- Issue:
- Volume 54:Issue 4(2019)
- Issue Display:
- Volume 54, Issue 4 (2019)
- Year:
- 2019
- Volume:
- 54
- Issue:
- 4
- Issue Sort Value:
- 2019-0054-0004-0000
- Page Start:
- 589
- Page End:
- 614
- Publication Date:
- 2018-11-12
- Subjects:
- clique chromatic number -- random graphs
Random graphs -- Periodicals
Mathematical analysis -- Periodicals
519 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1098-2418 ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/rsa.20804 ↗
- Languages:
- English
- ISSNs:
- 1042-9832
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 7254.411950
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 10333.xml