{"id":"https://openalex.org/W2079035346","doi":"https://doi.org/10.1137/s0097539794270248","title":"A Spectral Technique for Coloring Random 3-Colorable Graphs","display_name":"A Spectral Technique for Coloring Random 3-Colorable Graphs","publication_year":1997,"publication_date":"1997-12-01","ids":{"openalex":"https://openalex.org/W2079035346","doi":"https://doi.org/10.1137/s0097539794270248","mag":"2079035346"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794270248","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794270248","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Tel Aviv University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003810931","display_name":"Nabil Kahal\u00e9","orcid":"https://orcid.org/0000-0002-4009-6815"},"institutions":[{"id":"https://openalex.org/I1322087612","display_name":"Alcatel Lucent (Germany)","ror":"https://ror.org/00c5mwp75","country_code":"DE","type":"company","lineage":["https://openalex.org/I1322087612"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nabil Kahale","raw_affiliation_strings":["Lucent"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lucent","institution_ids":["https://openalex.org/I1322087612"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.6671,"has_fulltext":false,"cited_by_count":187,"citation_normalized_percentile":{"value":0.97840195,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"6","first_page":"1733","last_page":"1748"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9990000128746033,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.994700014591217,"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.8172796964645386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7088565826416016},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.577890157699585},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48781827092170715},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4773397743701935},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4647611379623413},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4422944188117981},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41227686405181885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1529640257358551}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8172796964645386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7088565826416016},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.577890157699585},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48781827092170715},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4773397743701935},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4647611379623413},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4422944188117981},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41227686405181885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1529640257358551},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539794270248","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794270248","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.8712","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.8712","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.caltech.edu/~dmoore/alon97.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.134.570","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.570","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~nogaa/PDFS/spectcol4.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.236","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.236","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~kahale/papers/jour.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1529433769","https://openalex.org/W1965419829","https://openalex.org/W1975442866","https://openalex.org/W1989042829","https://openalex.org/W2011039300","https://openalex.org/W2013737143","https://openalex.org/W2016776056","https://openalex.org/W2026709222","https://openalex.org/W2035155528","https://openalex.org/W2068179205","https://openalex.org/W2068871408","https://openalex.org/W2069816168","https://openalex.org/W2083883919","https://openalex.org/W2087392909","https://openalex.org/W2088164510","https://openalex.org/W2088272899","https://openalex.org/W2122753831","https://openalex.org/W2153478982","https://openalex.org/W2905110430","https://openalex.org/W3022136271","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2378491141","https://openalex.org/W168043308","https://openalex.org/W2148735344","https://openalex.org/W3120529295","https://openalex.org/W2170524605","https://openalex.org/W4250665764","https://openalex.org/W876530324","https://openalex.org/W1499927493","https://openalex.org/W3021187722","https://openalex.org/W2060490057"],"abstract_inverted_index":{"Let":[0],"G3n,p,3":[1,57],"be":[2,41,87,106],"a":[3,8,48,53,68,75,117],"random":[4,113],"3-colorable":[5],"graph":[6],"on":[7],"set":[9],"of":[10,31,33,56,77,112,142],"3n":[11],"vertices":[12,19,32],"generated":[13],"as":[14,120,122],"follows.":[15],"First,":[16],"split":[17],"the":[18,131],"arbitrarily":[20],"into":[21],"three":[22],"equal":[23],"color":[24,35],"classes,":[25,36],"and":[26,38,79],"then":[27],"choose":[28],"every":[29],"pair":[30],"distinct":[34],"randomly":[37],"independently,":[39],"to":[40,108],"edges":[42],"with":[43,58],"probability":[44],"p.":[45],"We":[46],"describe":[47],"polynomial-time":[49],"algorithm":[50,85,104,132],"that":[51,89,130],"finds":[52],"proper":[54],"3-coloring":[55],"high":[59],"probability,":[60],"whenever":[61],"p":[62,94],"$\\geq$":[63,95],"c/n,":[64],"where":[65],"c":[66],"is":[67],"sufficiently":[69],"large":[70],"absolute":[71],"constant.":[72],"This":[73],"settles":[74],"problem":[76],"Blum":[78],"Spencer,":[80],"who":[81],"asked":[82],"if":[83],"an":[84],"can":[86,105],"designed":[88],"works":[90],"almost":[91],"surely":[92],"for":[93,139],"polylog(n)/n":[96],"[J.":[97],"Algorithms,":[98],"19":[99],"(1995),":[100],"pp.":[101],"204--234].":[102],"The":[103],"extended":[107],"produce":[109],"optimal":[110],"k-colorings":[111],"k-colorable":[114],"graphs":[115],"in":[116,123,136],"similar":[118],"model":[119],"well":[121,135],"various":[124],"related":[125],"models.":[126],"Implementation":[127],"results":[128],"show":[129],"performs":[133],"very":[134],"practice":[137],"even":[138],"moderate":[140],"values":[141],"c.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":8}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}