On the chromatic number of random d-regular graphs

In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest integer satisfying d < 2 ( k − 1 ) log ( k − 1 ) . From previous lower bounds due to Molloy and Reed, this establishes the chromatic number to b...

Full description

Saved in:
Bibliographic Details
Published inAdvances in mathematics (New York. 1965) Vol. 223; no. 1; pp. 300 - 328
Main Authors Kemkes, Graeme, Pérez-Giménez, Xavier, Wormald, Nicholas
Format Journal Article
LanguageEnglish
Published Elsevier Inc 15.01.2010
Subjects
Random graphs
Random graphs
Online AccessGet full text

Cover

Abstract In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest integer satisfying d < 2 ( k − 1 ) log ( k − 1 ) . From previous lower bounds due to Molloy and Reed, this establishes the chromatic number to be asymptotically almost surely k − 1 or k. If moreover d > ( 2 k − 3 ) log ( k − 1 ) , then the value k − 1 is discarded and thus the chromatic number is exactly determined. Hence we improve a recently announced result by Achlioptas and Moore in which the chromatic number was allowed to take the value k + 1 . Our proof applies the small subgraph conditioning method to the number of equitable k-colourings, where a colouring is equitable if the number of vertices of each colour is equal.
AbstractList In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest integer satisfying d < 2 ( k − 1 ) log ( k − 1 ) . From previous lower bounds due to Molloy and Reed, this establishes the chromatic number to be asymptotically almost surely k − 1 or k. If moreover d > ( 2 k − 3 ) log ( k − 1 ) , then the value k − 1 is discarded and thus the chromatic number is exactly determined. Hence we improve a recently announced result by Achlioptas and Moore in which the chromatic number was allowed to take the value k + 1 . Our proof applies the small subgraph conditioning method to the number of equitable k-colourings, where a colouring is equitable if the number of vertices of each colour is equal.
Author Kemkes, Graeme
Wormald, Nicholas
Pérez-Giménez, Xavier
Author_xml – sequence: 1
  givenname: Graeme
  surname: Kemkes
  fullname: Kemkes, Graeme
  email: gdkemkes@uwaterloo.ca
  organization: Department of Mathematics, University of California, San Diego, La Jolla, CA 92093-0112, United States
– sequence: 2
  givenname: Xavier
  surname: Pérez-Giménez
  fullname: Pérez-Giménez, Xavier
  email: xperez@uwaterloo.ca
  organization: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada
– sequence: 3
  givenname: Nicholas
  surname: Wormald
  fullname: Wormald, Nicholas
  email: nwormald@uwaterloo.ca
  organization: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, ON, Canada
BookMark eNp9j8tqwzAQRUVJoUnaD-hOPyB3JLuWRFcl9AWBbNq1kOVxLBNbQXIK_fsqpOuuLgP3DPesyGIKExJyz6HgwOuHobB-LASALkAVAPUVWXLQwAQosSBLAOBMSVA3ZJXSkE9dcb0kYjfRuUfq-hhGO3tHp9PYYKSho9FObRhpyyLuTwcb6T7aY59uyXVnDwnv_nJNvl5fPjfvbLt7-9g8b5kTWs7MScXrmlcga1CyEiCU7DS6Ry273FBSYgm1tFpasGgr4LYqeYvY6qbJQ8s14Ze_LoaUInbmGP1o44_hYM7SZjBZ2pylDSiTpTPzdGEwD_v2GE1yHieHrY_oZtMG_w_9C_RRX2E
CitedBy_id crossref_primary_10_1016_j_amc_2024_128584
crossref_primary_10_1137_120861953
crossref_primary_10_1016_j_jctb_2015_09_006
crossref_primary_10_1017_S0963548318000251
crossref_primary_10_1093_imrn_rnv333
crossref_primary_10_1007_s00493_021_4236_z
crossref_primary_10_1017_S0963548316000390
crossref_primary_10_1007_s40747_024_01355_w
crossref_primary_10_1137_18M1180396
crossref_primary_10_1137_140997580
Cites_doi 10.1007/BF01375472
10.1002/jgt.20369
10.1002/rsa.1013
10.1007/BF01205080
10.1017/S0963548306007954
10.1016/j.disc.2008.12.014
10.1017/S0963548302005254
10.1016/0095-8956(92)90070-E
10.1017/S0963548306007693
10.1007/BF02122551
10.1016/j.jctb.2007.11.009
10.1007/BF01215914
10.4007/annals.2005.162.1335
10.1016/S0195-6698(80)80030-8
10.1002/rsa.3240050209
10.1007/BF02579208
ContentType Journal Article
Copyright 2009
Copyright_xml – notice: 2009
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.aim.2009.08.006
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1090-2082
EndPage 328
ExternalDocumentID 10_1016_j_aim_2009_08_006
S0001870809002515
GroupedDBID --K
--M
--Z
-~X
.~1
0R~
1B1
1RT
1~.
1~5
23M
4.4
457
4G.
5GY
5VS
6I.
6TJ
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AASFE
AAXUO
ABAOU
ABCQX
ABEFU
ABFNM
ABJNI
ABLJU
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNCT
ACRLP
ADBBV
ADEZE
ADFGL
ADIYS
ADMUD
AEBSH
AEKER
AENEX
AETEA
AEXQZ
AFDAS
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
D0L
DM4
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HVGLF
HX~
HZ~
IHE
IXB
J1W
KOM
LG5
M25
M41
MCRUF
MHUIS
MO0
MVM
N9A
NCXOZ
O-L
O9-
OAUVE
OHT
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSW
SSZ
T5K
UPT
WH7
XOL
XPP
ZCG
ZKB
ZMT
~G-
0SF
AAXKI
AAYXX
ADVLN
AFJKZ
AKRWK
CITATION
ID FETCH-LOGICAL-c297t-c7816614076087420287f9ec597fc29877e3067a97a0aea401a431deed9bb7083
IEDL.DBID IXB
ISSN 0001-8708
IngestDate Thu Sep 26 15:40:43 EDT 2024
Fri Feb 23 02:21:40 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Random graphs
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c297t-c7816614076087420287f9ec597fc29877e3067a97a0aea401a431deed9bb7083
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0001870809002515
PageCount 29
ParticipantIDs crossref_primary_10_1016_j_aim_2009_08_006
elsevier_sciencedirect_doi_10_1016_j_aim_2009_08_006
PublicationCentury 2000
PublicationDate 2010-01-15
PublicationDateYYYYMMDD 2010-01-15
PublicationDate_xml – month: 01
  year: 2010
  text: 2010-01-15
  day: 15
PublicationDecade 2010
PublicationTitle Advances in mathematics (New York. 1965)
PublicationYear 2010
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Łuczak (bib015) 1991; 11
Achlioptas, Naor (bib003) 2005; 162
Krivelevich, Sudakov, Vu, Wormald (bib014) 2001; 18
Łuczak (bib016) 1991; 11
Shamir, Spencer (bib019) 1987; 7
Shi, Wormald (bib020) 2007; 16
(bib001) 1972; vol. 55
M. Molloy, B.A. Reed, The chromatic number of sparse random graphs, Master's thesis, University of Waterloo, 1992
Cooper, Frieze, Reed, Riordan (bib009) 2002; 11
Robinson, Wormald (bib018) 1994; 5
Wormald (bib022) 1999; vol. 267
de Bruijn (bib010) 1970
Alon, Krivelevich (bib004) 1997; 17
Frieze, Łuczak (bib012) 1992; 54
Bollobás (bib006) 1980; 1
Coja-Oghlan, Panagiotou, Steger (bib008) 2008; 98
Janson, Łuczak, Ruciński (bib013) 2000
Ben-Shimon, Krivelevich (bib005) 2009; 309
Bollobás (bib007) 1988; 8
Achlioptas, Moore (bib002) 2004; vol. 3122
Shi, Wormald (bib021) 2007; 16
Díaz, Kaporis, Kemkes, Kirousis, Pérez, Wormald (bib011) 2009; 61
Wormald (10.1016/j.aim.2009.08.006_bib022) 1999; vol. 267
Alon (10.1016/j.aim.2009.08.006_bib004) 1997; 17
Krivelevich (10.1016/j.aim.2009.08.006_bib014) 2001; 18
Achlioptas (10.1016/j.aim.2009.08.006_bib003) 2005; 162
Robinson (10.1016/j.aim.2009.08.006_bib018) 1994; 5
10.1016/j.aim.2009.08.006_bib017
Bollobás (10.1016/j.aim.2009.08.006_bib007) 1988; 8
Díaz (10.1016/j.aim.2009.08.006_bib011) 2009; 61
Ben-Shimon (10.1016/j.aim.2009.08.006_bib005) 2009; 309
Łuczak (10.1016/j.aim.2009.08.006_bib016) 1991; 11
de Bruijn (10.1016/j.aim.2009.08.006_bib010) 1970
Cooper (10.1016/j.aim.2009.08.006_bib009) 2002; 11
Łuczak (10.1016/j.aim.2009.08.006_bib015) 1991; 11
Shamir (10.1016/j.aim.2009.08.006_bib019) 1987; 7
(10.1016/j.aim.2009.08.006_bib001) 1972; vol. 55
Shi (10.1016/j.aim.2009.08.006_bib021) 2007; 16
Bollobás (10.1016/j.aim.2009.08.006_bib006) 1980; 1
Coja-Oghlan (10.1016/j.aim.2009.08.006_bib008) 2008; 98
Janson (10.1016/j.aim.2009.08.006_bib013) 2000
Shi (10.1016/j.aim.2009.08.006_bib020) 2007; 16
Achlioptas (10.1016/j.aim.2009.08.006_bib002) 2004; vol. 3122
Frieze (10.1016/j.aim.2009.08.006_bib012) 1992; 54
References_xml – volume: 162
  start-page: 1333
  year: 2005
  end-page: 1349
  ident: bib003
  article-title: The two possible values of the chromatic number of a random graph
  publication-title: Ann. of Math.
  contributor:
    fullname: Naor
– volume: 11
  start-page: 323
  year: 2002
  end-page: 341
  ident: bib009
  article-title: Random regular graphs of non-constant degree: Independence and chromatic number
  publication-title: Combin. Probab. Comput.
  contributor:
    fullname: Riordan
– volume: 54
  start-page: 123
  year: 1992
  end-page: 132
  ident: bib012
  article-title: On the independence and chromatic numbers of random regular graphs
  publication-title: J. Combin. Theory Ser. B
  contributor:
    fullname: Łuczak
– volume: 98
  start-page: 980
  year: 2008
  end-page: 993
  ident: bib008
  article-title: On the chromatic number of random graphs
  publication-title: J. Combin. Theory Ser. B
  contributor:
    fullname: Steger
– volume: 16
  start-page: 459
  year: 2007
  end-page: 494
  ident: bib021
  article-title: Colouring random regular graphs
  publication-title: Combin. Probab. Comput.
  contributor:
    fullname: Wormald
– volume: 8
  start-page: 49
  year: 1988
  end-page: 55
  ident: bib007
  article-title: The chromatic number of random graphs
  publication-title: Combinatorica
  contributor:
    fullname: Bollobás
– volume: 5
  start-page: 363
  year: 1994
  end-page: 374
  ident: bib018
  article-title: Almost all regular graphs are hamiltonian
  publication-title: Random Structures Algorithms
  contributor:
    fullname: Wormald
– volume: 11
  start-page: 45
  year: 1991
  end-page: 54
  ident: bib015
  article-title: The chromatic number of random graphs
  publication-title: Combinatorica
  contributor:
    fullname: Łuczak
– volume: 7
  start-page: 121
  year: 1987
  end-page: 129
  ident: bib019
  article-title: Sharp concentration of the chromatic number on random graphs
  publication-title: Combinatorica
  contributor:
    fullname: Spencer
– volume: vol. 55
  year: 1972
  ident: bib001
  publication-title: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
– volume: 11
  start-page: 295
  year: 1991
  end-page: 297
  ident: bib016
  article-title: A note on the sharp concentration of the chromatic number of random graphs
  publication-title: Combinatorica
  contributor:
    fullname: Łuczak
– volume: 1
  start-page: 311
  year: 1980
  end-page: 316
  ident: bib006
  article-title: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
  publication-title: European J. Combin.
  contributor:
    fullname: Bollobás
– volume: vol. 267
  start-page: 239
  year: 1999
  end-page: 298
  ident: bib022
  article-title: Models of random regular graphs
  publication-title: Surveys in Combinatorics 1999
  contributor:
    fullname: Wormald
– volume: vol. 3122
  start-page: 219
  year: 2004
  end-page: 228
  ident: bib002
  article-title: The chromatic number of random regular graphs
  publication-title: Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 8th International Workshop on Randomization and Computation
  contributor:
    fullname: Moore
– year: 2000
  ident: bib013
  article-title: Random Graphs
  contributor:
    fullname: Ruciński
– volume: 61
  start-page: 157
  year: 2009
  end-page: 191
  ident: bib011
  article-title: On the chromatic number of a random 5-regular graph
  publication-title: J. Graph Theory
  contributor:
    fullname: Wormald
– volume: 17
  start-page: 303
  year: 1997
  end-page: 313
  ident: bib004
  article-title: The concentration of the chromatic number of random graphs
  publication-title: Combinatorica
  contributor:
    fullname: Krivelevich
– volume: 309
  start-page: 4149
  year: 2009
  end-page: 4161
  ident: bib005
  article-title: Random regular graphs of non-constant degree: Concentration of the chromatic number
  publication-title: Discrete Math.
  contributor:
    fullname: Krivelevich
– year: 1970
  ident: bib010
  article-title: Asymptotic Methods in Analysis
  contributor:
    fullname: de Bruijn
– volume: 18
  start-page: 346
  year: 2001
  end-page: 363
  ident: bib014
  article-title: Random regular graphs of high degree
  publication-title: Random Structures Algorithms
  contributor:
    fullname: Wormald
– volume: 16
  start-page: 309
  year: 2007
  end-page: 344
  ident: bib020
  article-title: Colouring random 4-regular graphs
  publication-title: Combin. Probab. Comput.
  contributor:
    fullname: Wormald
– volume: 11
  start-page: 45
  issue: 1
  year: 1991
  ident: 10.1016/j.aim.2009.08.006_bib015
  article-title: The chromatic number of random graphs
  publication-title: Combinatorica
  doi: 10.1007/BF01375472
  contributor:
    fullname: Łuczak
– volume: vol. 55
  year: 1972
  ident: 10.1016/j.aim.2009.08.006_bib001
– year: 1970
  ident: 10.1016/j.aim.2009.08.006_bib010
  contributor:
    fullname: de Bruijn
– volume: 61
  start-page: 157
  issue: 3
  year: 2009
  ident: 10.1016/j.aim.2009.08.006_bib011
  article-title: On the chromatic number of a random 5-regular graph
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.20369
  contributor:
    fullname: Díaz
– volume: 18
  start-page: 346
  issue: 4
  year: 2001
  ident: 10.1016/j.aim.2009.08.006_bib014
  article-title: Random regular graphs of high degree
  publication-title: Random Structures Algorithms
  doi: 10.1002/rsa.1013
  contributor:
    fullname: Krivelevich
– volume: 11
  start-page: 295
  issue: 3
  year: 1991
  ident: 10.1016/j.aim.2009.08.006_bib016
  article-title: A note on the sharp concentration of the chromatic number of random graphs
  publication-title: Combinatorica
  doi: 10.1007/BF01205080
  contributor:
    fullname: Łuczak
– volume: vol. 3122
  start-page: 219
  year: 2004
  ident: 10.1016/j.aim.2009.08.006_bib002
  article-title: The chromatic number of random regular graphs
  contributor:
    fullname: Achlioptas
– volume: 16
  start-page: 459
  issue: 3
  year: 2007
  ident: 10.1016/j.aim.2009.08.006_bib021
  article-title: Colouring random regular graphs
  publication-title: Combin. Probab. Comput.
  doi: 10.1017/S0963548306007954
  contributor:
    fullname: Shi
– volume: vol. 267
  start-page: 239
  year: 1999
  ident: 10.1016/j.aim.2009.08.006_bib022
  article-title: Models of random regular graphs
  contributor:
    fullname: Wormald
– volume: 309
  start-page: 4149
  issue: 12
  year: 2009
  ident: 10.1016/j.aim.2009.08.006_bib005
  article-title: Random regular graphs of non-constant degree: Concentration of the chromatic number
  publication-title: Discrete Math.
  doi: 10.1016/j.disc.2008.12.014
  contributor:
    fullname: Ben-Shimon
– volume: 11
  start-page: 323
  issue: 4
  year: 2002
  ident: 10.1016/j.aim.2009.08.006_bib009
  article-title: Random regular graphs of non-constant degree: Independence and chromatic number
  publication-title: Combin. Probab. Comput.
  doi: 10.1017/S0963548302005254
  contributor:
    fullname: Cooper
– year: 2000
  ident: 10.1016/j.aim.2009.08.006_bib013
  contributor:
    fullname: Janson
– volume: 54
  start-page: 123
  issue: 1
  year: 1992
  ident: 10.1016/j.aim.2009.08.006_bib012
  article-title: On the independence and chromatic numbers of random regular graphs
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/0095-8956(92)90070-E
  contributor:
    fullname: Frieze
– volume: 16
  start-page: 309
  issue: 2
  year: 2007
  ident: 10.1016/j.aim.2009.08.006_bib020
  article-title: Colouring random 4-regular graphs
  publication-title: Combin. Probab. Comput.
  doi: 10.1017/S0963548306007693
  contributor:
    fullname: Shi
– volume: 8
  start-page: 49
  issue: 1
  year: 1988
  ident: 10.1016/j.aim.2009.08.006_bib007
  article-title: The chromatic number of random graphs
  publication-title: Combinatorica
  doi: 10.1007/BF02122551
  contributor:
    fullname: Bollobás
– volume: 98
  start-page: 980
  issue: 5
  year: 2008
  ident: 10.1016/j.aim.2009.08.006_bib008
  article-title: On the chromatic number of random graphs
  publication-title: J. Combin. Theory Ser. B
  doi: 10.1016/j.jctb.2007.11.009
  contributor:
    fullname: Coja-Oghlan
– volume: 17
  start-page: 303
  issue: 3
  year: 1997
  ident: 10.1016/j.aim.2009.08.006_bib004
  article-title: The concentration of the chromatic number of random graphs
  publication-title: Combinatorica
  doi: 10.1007/BF01215914
  contributor:
    fullname: Alon
– ident: 10.1016/j.aim.2009.08.006_bib017
– volume: 162
  start-page: 1333
  issue: 3
  year: 2005
  ident: 10.1016/j.aim.2009.08.006_bib003
  article-title: The two possible values of the chromatic number of a random graph
  publication-title: Ann. of Math.
  doi: 10.4007/annals.2005.162.1335
  contributor:
    fullname: Achlioptas
– volume: 1
  start-page: 311
  issue: 4
  year: 1980
  ident: 10.1016/j.aim.2009.08.006_bib006
  article-title: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
  publication-title: European J. Combin.
  doi: 10.1016/S0195-6698(80)80030-8
  contributor:
    fullname: Bollobás
– volume: 5
  start-page: 363
  issue: 2
  year: 1994
  ident: 10.1016/j.aim.2009.08.006_bib018
  article-title: Almost all regular graphs are hamiltonian
  publication-title: Random Structures Algorithms
  doi: 10.1002/rsa.3240050209
  contributor:
    fullname: Robinson
– volume: 7
  start-page: 121
  issue: 1
  year: 1987
  ident: 10.1016/j.aim.2009.08.006_bib019
  article-title: Sharp concentration of the chromatic number on random graphs Gn,p
  publication-title: Combinatorica
  doi: 10.1007/BF02579208
  contributor:
    fullname: Shamir
SSID ssj0009419
Score 2.0678074
Snippet In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest...
SourceID crossref
elsevier
SourceType Aggregation Database
Publisher
StartPage 300
SubjectTerms Random graphs
Title On the chromatic number of random d-regular graphs
URI https://dx.doi.org/10.1016/j.aim.2009.08.006
Volume 223
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6VssCAeIryqDwwIZnGIY3rsa2oCn2AEEXdIju1RZGaVGlZ-e2cnYSHBAuTFcuW4kt09518930AFy1l_Nh4nEoRzjBBYYwqbRDIMR5yobyYub610TjsT4K7aXNagW7ZC2PLKgvfn_t0562LmUZhzcZyPrc9vlZQDhGPcEDZNppbbk_bxDftfBHvBqyAwIza1eXNpqvxkvNFQVlpKyrD32PTt3jT24WdAiiSdv4ue1DRyT5sjz5ZVlcH4N8nBB9J_JKlbo7k-h4kNQRD0CxdkBnNnNh8Rhwz9eoQJr2bp26fFhoINPYFX9OY24s9zIJ46LUwjUU4wI3QMeYBBle0ONcW9EvBpSe1RGNLhAQzjHxCKTzu9RFUkzTRx0AsGDQmFNpnKjBSoXvxMEH1PX0tZNMXNbgsTx8tc6qLqKwBe43QVFayUkRWtdILaxCU9ol-fK8IXfHf207-t-0UtvJbe0ZZ8wyq6-xNnyMYWKs6bFy9szpstjvPg6Edu4_DBzveDvrjuvsXPgAH8rRV
link.rule.ids 315,786,790,3525,4521,24144,27602,27957,27958,45620,45698,45714,45909
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB5qPagH8Yn1mYMnITTZ7m6aoxZLq229tNDbkuwmWKG7ZVv_v5N9-AC9eExIIJmEmW-Yxwdw29XWiy0TVMkwQQeFc6qNRSDHRSikZjEv6tbGk3Aw85_mwbwBvboWxqVVVrq_1OmFtq5m2pU026vFwtX4OkI5RDyyAMrBFmz7gWTuaw_nD1-dd31eYWBO3fI6tFkkeanFsupZ6VIqw9-N0zeD0z-A_QopkvvyMIfQMOkR7I0_26yuj8F7SQkOSfyaZ8UcKQk-SGYJ2qAkW5KE5gXbfE6K1tTrE5j1H6e9Aa1IEGjsSbGhsXCRPXSDRMi66MciHhBWmhgdAYsrukIYh_qVFIopo1DaCjFBgqZPao3X7ZxCM81ScwbEoUFrQ2k8rn2rNOoXhh6qx0xHqsCTLbirbx-tyl4XUZ0E9hahqBxnpYwcbSULW-DX8ol-PFiEuvjvbef_23YDO4PpeBSNhpPnC9gtQ_ic8uASmpv83VwhMtjo6-LlPwArJLHI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+chromatic+number+of+random+d-regular+graphs&rft.jtitle=Advances+in+mathematics+%28New+York.+1965%29&rft.au=Kemkes%2C+Graeme&rft.au=P%C3%A9rez-Gim%C3%A9nez%2C+Xavier&rft.au=Wormald%2C+Nicholas&rft.date=2010-01-15&rft.issn=0001-8708&rft.volume=223&rft.issue=1&rft.spage=300&rft.epage=328&rft_id=info:doi/10.1016%2Fj.aim.2009.08.006&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_aim_2009_08_006
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0001-8708&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0001-8708&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0001-8708&client=summon