Skip to main content
SpringerLink
Log in

The Set Chromatic Number of Random Graphs

  • Conference paper
  • First Online:
Extended Abstracts Summer 2015

Part of the book series: Trends in Mathematics ((RPCRMB,volume 6))

  • 430 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 149.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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.

    Article  MathSciNet  MATH  Google Scholar 

  2. R. Gera, F. Okamoto, C. Rasmussen, and P. Zhang, “Set colorings in perfect graphs”, Math. Bohem. 136 (2011), 61–68.

    Google Scholar 

  3. T. Łuczak, “The chromatic number of random graphs”, Combinatorica 11 (1) (1991), 45–54.

    Google Scholar 

  4. C. McDiarmid, “On the chromatic number of random graphs”, Random Structures & Algorithms 1 (4) (1990), 435–442.

    Google Scholar 

  5. J.S. Sereni, Z. Yilma, “A tight bound on the set chromatic number”, Discuss. Math. Graph Theory, 33 (2013), 461–465.

    Article  MathSciNet  MATH  Google Scholar 

Download references

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

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, USA

    Andrzej Dudek

  2. Laboratoire J-A Dieudonné, Université de Nice Sophia-Antipolis, Parc Valrose, 06108, Nice cedex 02, France

    Dieter Mitsche

  3. Department of Mathematics, Ryerson University, Toronto, ON, Canada

    Paweł Prałat

Authors
  1. Andrzej Dudek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dieter Mitsche
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paweł Prałat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Dudek .

Editor information

Editors and Affiliations

  1. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya, Barcelona, Spain

    Josep Díaz

  2. Department of Mathematics, National and Kapodistrian University, Zografos, Greece

    Lefteris Kirousis

  3. Department of Econometrics, University of Barcelona, Barcelona, Spain

    Luis Ortiz-Gracia

  4. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya, Barcelona, Spain

    Maria Serna

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation