On the chromatic number of the preferential attachment graph

Achlioptas, 2004, The chromatic number of random regular graphs, 219 Albert, 1999, Emergence of scaling in random networks, Science, 286, 509, 10.1126/science.286.5439.509 Albert, 2002, Statistical mechanics of complex networks, Rev. Modern Phys., 74, 47, 10.1103/RevModPhys.74.47 Bender, 1978, The asymptotic number of labelled graphs with given degree sequences., J. Combin. Theory (A), 296, 10.1016/0097-3165(78)90059-6 Bollobás, 1988, The chromatic number of random graphs, Combinatorica, 8, 49, 10.1007/BF02122551 Bollobás, 2001 Bollobás, 2003, Mathematical results on scale-free random graphs, Handb. Graphs Netw.: Genome Internet, 1 Coja-Oghlan, 2016, On the chromatic number of random regular graphs, J. Combin. Theory Ser. B, 116, 367, 10.1016/j.jctb.2015.09.006 Erdős, 1959, On random graphs I, Publ. Math. (Debrecen), 1, 290 Erdős, 1960, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci., 1, 17 Garavaglia, 2019, Subgraphs in preferential attachment models, Adv. Appl. Probab., 51, 898, 10.1017/apr.2019.36 Kovalenko, 2020, On the independence number and the chromatic number of generalized preferential attachment models, Discrete Appl. Math., 285, 301, 10.1016/j.dam.2020.04.035 Paley, 1932, On some series of functions, (3), Math. Proc. Camb. Phil. Soc., 28, 190, 10.1017/S0305004100010860 Wormald, 1978 Wormald, 1999, Models of random regular graphs, Lond. Math. Soc. Lect. Note Ser., 239