{"id":"https://openalex.org/W2164437357","doi":"https://doi.org/10.1145/1007352.1007442","title":"The two possible values of the chromatic number of a random graph","display_name":"The two possible values of the chromatic number of a random graph","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2164437357","doi":"https://doi.org/10.1145/1007352.1007442","mag":"2164437357"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021300666","display_name":"Dimitris Achlioptas","orcid":"https://orcid.org/0000-0003-2349-822X"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dimitris Achlioptas","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052985577","display_name":"Assaf Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Assaf Naor","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"587","last_page":"593"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9765999913215637,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7882699370384216},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.7597624659538269},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6371147632598877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6282085180282593},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5954254865646362},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.500709056854248},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4945485293865204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48332691192626953},{"id":"https://openalex.org/keywords/windmill-graph","display_name":"Windmill graph","score":0.46398237347602844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19296270608901978},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.12955975532531738},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06300854682922363}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7882699370384216},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.7597624659538269},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6371147632598877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6282085180282593},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5954254865646362},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.500709056854248},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4945485293865204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48332691192626953},{"id":"https://openalex.org/C73380178","wikidata":"https://www.wikidata.org/wiki/Q8024306","display_name":"Windmill graph","level":5,"score":0.46398237347602844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19296270608901978},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.12955975532531738},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06300854682922363},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007352.1007442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1559492868","https://openalex.org/W1988522098","https://openalex.org/W2006544720","https://openalex.org/W2012724629","https://openalex.org/W2037787045","https://openalex.org/W2060664509","https://openalex.org/W2068871408","https://openalex.org/W2077154649","https://openalex.org/W2082249316","https://openalex.org/W2099961420","https://openalex.org/W2112575355","https://openalex.org/W2138163102","https://openalex.org/W2165341195","https://openalex.org/W2478722229","https://openalex.org/W2905110430","https://openalex.org/W3142570770","https://openalex.org/W3144881883","https://openalex.org/W6793127252"],"related_works":["https://openalex.org/W2091414672","https://openalex.org/W2891101917","https://openalex.org/W2049992750","https://openalex.org/W4240570119","https://openalex.org/W1526979981","https://openalex.org/W3120282738","https://openalex.org/W2057367302","https://openalex.org/W2390298591","https://openalex.org/W2078386971","https://openalex.org/W2562183448"],"abstract_inverted_index":{"For":[0],"every":[1],"d":[2,14,38],">":[3],"0,":[4],"let":[5],"kd":[6,32],"be":[7],"the":[8,22,53],"smallest":[9],"integer":[10],"k":[11,42],"such":[12],"that":[13,21,52],"<":[15],"2k":[16,46],"log":[17,41,44,47],"k.":[18],"We":[19],"prove":[20,51],"chromatic":[23,54],"number":[24,55],"of":[25],"a":[26],"random":[27],"graph":[28],"G(n,d/n)":[29],"is":[30],"either":[31],"or":[33],"kd+1":[34],"almost":[35,56],"surely.":[36],"If":[37],"\u2208":[39],"(2k":[40],"-":[43],"k,":[45],"k)":[48],"we":[49],"further":[50],"surely":[57],"equals":[58],"k+1.":[59]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}