Abstract
In this paper we study the chromatic number χ(G n,p) of the binomial random graph G n,p, where p = p(n) ≤ n − 3/4 − δ, for every fixed δ> 0. We prove that a.a.s. χ(G n,p) is ℓ, ℓ + 1, or ℓ + 2, where ℓ is the maximum integer satisfying 2(ℓ − 1)log(ℓ − 1) ≤ np.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. System Sci. 57(2), 187–199 (1998)
Zeitlhofer, T., Wess, B.: A comparison of graph coloring heuristics for register allocation based on coalescing in interval graphs. In: ISCAS (4), 529–532 (2004)
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part ii, graph coloring and number partitioning. Oper. Res. 39(3), 378–406 (1991)
Krivelevich, M.: Coloring random graphs—an algorithmic perspective. In: Mathematics and computer science, II (Versailles, 2002). Trends Math. Birkhäuser, Basel, pp. 175–195 (2002)
Achlioptas, D., Moore, C.: Almost all graphs with average degree 4 are 3-colorable. J. Comput. System Sci. 67(2), 441–471 (2003), Special issue on STOC 2002 (Montreal, QC)
Jia, H., Moore, C.: How much backtracking does it take to color random graphs? Rigorous results on heavy tails (2004)
Mulet, R., Pagnani, A., Weigt, M., Zecchina, R.: Coloring random graphs. Physical Review Letters 89, 268701 (2002)
Braunstein, A., Mulet, R., Pagnani, A., Weigt, M., Zecchina, R.: Polynomial iterative algorithms for coloring and analyzing random graphs. Physical Review E 68, 36702 (2003)
Achlioptas, D., Naor, A.: The two possible values of the chromatic number of a random graph. Ann. of Math. (2) 162(3), 1335–1351 (2005)
Erdős, P., Rényi, A.: On random graphs. I. Publ. Math. Debrecen 6, 290–297 (1959)
Bollobás, B.: The chromatic number of random graphs. Combinatorica 8(1), 49–55 (1988)
Łuczak, T.: A note on the sharp concentration of the chromatic number of random graphs. Combinatorica 11(3), 295–297 (1991)
Shamir, E., Spencer, J.: Sharp concentration of the chromatic number on random graphs G n,p. Combinatorica 7(1), 121–129 (1987)
Alon, N., Krivelevich, M.: The concentration of the chromatic number of random graphs. Combinatorica 17(3), 303–313 (1997)
Achlioptas, D., Friedgut, E.: A sharp threshold for k-colorability. Random Structures Algorithms 14(1), 63–70 (1999)
http://www.ti.inf.ethz.ch/as/people/panagiotou/papers/CNoSRG.ps
Alon, N., Spencer, J.H.: The probabilistic method, 2nd edn. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], Chichester (2000)
Janson, S., Łuczak, T., Rucinski, A.: Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, Chichester (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coja-Oghlan, A., Panagiotou, K., Steger, A. (2007). On the Chromatic Number of Random Graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)