On the chromatic number of random regular graphs

Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if dd_{k-col}.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Coja-Oghlan, Amin, Efthymiou, Charilaos, Hetterich, Samuel
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics Mathematics - Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue
container_start_page
container_title
container_volume
creator	Coja-Oghlan, Amin Efthymiou, Charilaos Hetterich, Samuel
description	Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if dd_{k-col}.
doi_str_mv	10.48550/arxiv.1308.4287
format	Article
fullrecord	<record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1308_4287</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1308_4287</sourcerecordid><originalsourceid>FETCH-LOGICAL-a657-4eabdd7c8a1719a1d9cd3f24a3ca9e156690027d21bc5845e5b9a36aa0c1ab5b3</originalsourceid><addsrcrecordid>eNotzrtuwjAYhmEvDAjYmZBvIKkd27E9ItSThMTCHn0-hEQiCfqBqr37Ctrp3V49jK2lKLUzRryAvvuvUirhSl05O2fiMPJbl3nsaBpw6yMf70PIxKeWE8Y0DZzy6X4G8RPh0l2XbNbifM2r_y7Y8e31uPso9of3z912X6A2ttAZISUbHaSVHjL5mFRbaagIn6Wpay9EZVMlQzROm2yCh6oBESWCCWrBNn_bp7i5UD-AfpqHvHnI1S_Xmj3t</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the chromatic number of random regular graphs</title><source>arXiv.org</source><creator>Coja-Oghlan, Amin ; Efthymiou, Charilaos ; Hetterich, Samuel</creator><creatorcontrib>Coja-Oghlan, Amin ; Efthymiou, Charilaos ; Hetterich, Samuel</creatorcontrib><description>Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}.</description><identifier>DOI: 10.48550/arxiv.1308.4287</identifier><language>eng</language><subject>Mathematics - Combinatorics ; Mathematics - Probability</subject><creationdate>2013-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1308.4287$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1308.4287$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Coja-Oghlan, Amin</creatorcontrib><creatorcontrib>Efthymiou, Charilaos</creatorcontrib><creatorcontrib>Hetterich, Samuel</creatorcontrib><title>On the chromatic number of random regular graphs</title><description>Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}.</description><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Probability</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrtuwjAYhmEvDAjYmZBvIKkd27E9ItSThMTCHn0-hEQiCfqBqr37Ctrp3V49jK2lKLUzRryAvvuvUirhSl05O2fiMPJbl3nsaBpw6yMf70PIxKeWE8Y0DZzy6X4G8RPh0l2XbNbifM2r_y7Y8e31uPso9of3z912X6A2ttAZISUbHaSVHjL5mFRbaagIn6Wpay9EZVMlQzROm2yCh6oBESWCCWrBNn_bp7i5UD-AfpqHvHnI1S_Xmj3t</recordid><startdate>20130820</startdate><enddate>20130820</enddate><creator>Coja-Oghlan, Amin</creator><creator>Efthymiou, Charilaos</creator><creator>Hetterich, Samuel</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20130820</creationdate><title>On the chromatic number of random regular graphs</title><author>Coja-Oghlan, Amin ; Efthymiou, Charilaos ; Hetterich, Samuel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a657-4eabdd7c8a1719a1d9cd3f24a3ca9e156690027d21bc5845e5b9a36aa0c1ab5b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Probability</topic><toplevel>online_resources</toplevel><creatorcontrib>Coja-Oghlan, Amin</creatorcontrib><creatorcontrib>Efthymiou, Charilaos</creatorcontrib><creatorcontrib>Hetterich, Samuel</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Coja-Oghlan, Amin</au><au>Efthymiou, Charilaos</au><au>Hetterich, Samuel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the chromatic number of random regular graphs</atitle><date>2013-08-20</date><risdate>2013</risdate><abstract>Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k_0 we identify a number d_{k-col} such that G(n,d) is k-colorable w.h.p. if d<d_{k-col} and non-k-colorable w.h.p. if d>d_{k-col}.</abstract><doi>10.48550/arxiv.1308.4287</doi><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	DOI: 10.48550/arxiv.1308.4287
ispartof
issn
language	eng
recordid	cdi_arxiv_primary_1308_4287
source	arXiv.org
subjects	Mathematics - Combinatorics Mathematics - Probability
title	On the chromatic number of random regular graphs
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-11T06%3A33%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20chromatic%20number%20of%20random%20regular%20graphs&rft.au=Coja-Oghlan,%20Amin&rft.date=2013-08-20&rft_id=info:doi/10.48550/arxiv.1308.4287&rft_dat=%3Carxiv_GOX%3E1308_4287%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true