Abstract
Probabilistic arguments has come to be a powerful way to obtain bounds on various chromatic numbers. It plays an important role not only in obtaining upper bounds but also in establishing the tightness of these upper bounds. It often calls for the application of various (often simple) ideas, tools and techniques (from probability theory) like moments, concentration inequalities, known estimates on tail probabilities and various other probability estimates. A number of examples illustrate how this approach can be a very useful tool in obtaining chromatic bounds. For many of these bounds, no other approach for obtaining them is known so far. In this talk, we illustrate this approach with some specific applications to graph coloring. On the other hand, several specific applications of this approach have also motivated and led to the development of powerful tools for handling discrete probability spaces. An important tool (for establishing the tightness results) is the notion of random graphs. We do not necessarily present the best results (obtained using this approach) since the main purpose is to provide an introduction to the power and simplicity of the approach. Many of the examples and the results are already known and published in the literature and have also been improved further.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N.: Choice numbers of graphs: A probabilistic approach. Combinatorics, Probability and Computing 1(2), 107–114 (1992)
Grünbaum, B.: Acyclic colorings of planar graphs. Israel Journal of Mathematics 14(3), 390–408 (1973)
Kahn, J.: Asymptotically good list-colorings. Journal of Combinatorial Theory, Series A 73(1), 1–59 (1996)
Kim, J.H.: On brooks’ theorem for sparse graphs. Combinatorics, Probability and Computing 4(2), 97–132 (1995)
Alon, N., Krivelevich, M., Sudakov, B.: Colouring graphs with sparse neighborhoods. Journal of Combinatorial Theory, Series B 77(1), 73–82 (1999)
Erdös, P., Lovasz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Hajnal, A., Rado, R., Sos, V.T. (eds.) Infinite and Finite Series, pp. 609–628 (1975)
Alon, N., McDiarmid, C., Reed, B.: Acyclic coloring of graphs. Random Structures and Algorithms 2(3), 277–288 (1991)
Hind, H., Molloy, M., Reed, B.: Colouring a graph frugally. Combinatorica 17(4), 469–482 (1997)
Hind, H., Molloy, M., Reed, B.: Total coloring with Δ + poly(logΔ) colors. SIAM Journal on Computing 28(3), 816–821 (1998)
Muthu, R., Narayanan, N., Subramanian, C.R.: Improved bounds on acylic edge colouring. Discrete Mathematics 307(23), 3063–3069 (2007)
Muthu, R., Narayanan, N., Subramanian, C.R.: On k-intersection edge colourings. Discussiones Mathematicae Graph Theory 29(2), 411–418 (2009)
Pemmaraju, S., Srinivasan, A.: The randomized coloring procedure with symmetry-breaking. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 306–319. Springer, Heidelberg (2008)
Greenhill, C., Pikhurko, O.: Bounds on the generalized acylic chromatic numbers of bounded degree graphs. Graphs and Combinatorics 21(4), 407–419 (2005)
Fertin, G., Raspaud, A., Reed, B.: Star coloring of graphs. Journal of Graph Theory 47(3), 163–182 (2004)
Molly, M., Reed, B.: Graph Colouring and the Probabilistic Method. Springer, Germany (2000)
Kostochka, A.V., Sopena, E., Zhu, X.: Acyclic and oriented chromatic numbers of graphs. Journal of Graph Theory 24(4), 331–340 (1997)
Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. John Wiley & Sons, Inc., New York (2008)
Subramanian, C.R.: List set coloring: bounds and algorithms. Combinatorics, Probability and Computing 16(1), 145–158 (2007)
Subramanian, C.R.: List hereditary colorings. In: Proceedings of the 2nd International Conference on Discrete Mathematics (ICDM), India, June 6-10. RMS Lecture Note Series, vol. 13, pp. 191–205. Ramanujan Mathematical Society (2010)
Subramanian, C.R.: List hereditary colorings of graphs and hypergraphs (2014) (manuscript)
Aravind, N.R., Subramanian, C.R.: Bounds on edge colorings with restrictions on the union of color classes. SIAM Journal of Discrete Mathematics 24(3), 841–852 (2010)
Aravind, N.R., Subramanian, C.R.: Bounds on vertex colorings with restrictions on the union of color classes. Journal of Graph Theory 66(3), 213–234 (2011)
Aravind, N.R., Subramanian, C.R.: Forbidden subgraph colorings and the oriented chromatic number. European Journal of Combinatorics 34, 620–631 (2013)
Reed, B., Sudakov, B.: Asymptotically the list colouring constants are 1. Journal of Combinatorial Theory, Series B 86(1), 27–37 (2002)
Alon, N., Sudakov, B., Zaks, A.: Acylic edge colorings of graphs. Journal of Graph Theory 37(3), 157–167 (2001)
Gebremedhin, A., Tarafdar, A., Manne, F., Pothen, A.: New acyclic and star coloring algorithms with applications to Hessian computation. SIAM Journal on Scientific Computing 29, 1042–1072 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Subramanian, C.R. (2015). Probabilistic Arguments in Graph Coloring (Invited Talk). In: Ganguly, S., Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer, Cham. https://doi.org/10.1007/978-3-319-14974-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-14974-5_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14973-8
Online ISBN: 978-3-319-14974-5
eBook Packages: Computer ScienceComputer Science (R0)