{"id":"https://openalex.org/W2096478102","doi":"https://doi.org/10.1109/sfcs.2002.1181879","title":"Hardness results for coloring 3-colorable 3-uniform hypergraphs","display_name":"Hardness results for coloring 3-colorable 3-uniform hypergraphs","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2096478102","doi":"https://doi.org/10.1109/sfcs.2002.1181879","mag":"2096478102"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Khot","raw_affiliation_strings":["Department of Computer Science, Princeton University, USA","Dept. of Computer Sci., Princeton Univ., NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Dept. of Computer Sci., Princeton Univ., NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067917669"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"23","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996999979019165,"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.9883999824523926,"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/hypergraph","display_name":"Hypergraph","score":0.9735172986984253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7482901811599731},{"id":"https://openalex.org/keywords/monochromatic-color","display_name":"Monochromatic color","score":0.7181411981582642},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6578851938247681},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6334359645843506},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6105121970176697},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4796041250228882},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39448660612106323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2232397496700287},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11837753653526306},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10667932033538818},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.06341835856437683}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9735172986984253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7482901811599731},{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.7181411981582642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6578851938247681},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6334359645843506},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6105121970176697},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4796041250228882},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39448660612106323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2232397496700287},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11837753653526306},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10667932033538818},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06341835856437683},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2002.1181879","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.8045","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.8045","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.huji.ac.il/~inapprox/papers/Khot-3sat-hyper-col.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.124.1644","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.1644","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-static.cc.gatech.edu/~khot/papers/3-uni-color.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W132909967","https://openalex.org/W1501644705","https://openalex.org/W1529433769","https://openalex.org/W1970259241","https://openalex.org/W1973582947","https://openalex.org/W1999470336","https://openalex.org/W2019578639","https://openalex.org/W2081254453","https://openalex.org/W2087226760","https://openalex.org/W2094135928","https://openalex.org/W2096367977","https://openalex.org/W2104254886","https://openalex.org/W2120358419","https://openalex.org/W2132991500","https://openalex.org/W2138792657","https://openalex.org/W2139689595","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2160033075","https://openalex.org/W2162018802","https://openalex.org/W2166366531","https://openalex.org/W4242357733","https://openalex.org/W4242370932","https://openalex.org/W6650312148"],"related_works":["https://openalex.org/W2509614667","https://openalex.org/W4376608589","https://openalex.org/W2963293152","https://openalex.org/W4302199713","https://openalex.org/W4282026465","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W2988746064","https://openalex.org/W2045621845"],"abstract_inverted_index":{"We":[0,36,123,205],"consider":[1],"the":[2,11,28,94,98,104,109,118,141,155,185,211,224,249,252,265,269],"problem":[3],"of":[4,14,80,97,120,140,154,184,196,210,218,223,286],"coloring":[5,139],"a":[6,18,44,56,66,101,132,174,193,197,207,240,274],"3-colorable":[7,19,45,73,136],"3-uniform":[8,20,46,67,102,133,242],"hypergraph.":[9],"In":[10,52,93,248,264],"minimization":[12],"version":[13,96],"this":[15,219],"problem,":[16,99],"given":[17,100],"hypergraph,":[21,103],"one":[22],"seeks":[23],"an":[24,85,164,283],"algorithm":[25],"to":[26,42,63,107,116,129,178,238],"color":[27,43,108,176,239],"hypergraph":[29,47,68,134,243,253,270],"with":[30,48,69,111,143,244],"as":[31,34,115],"few":[32],"colors":[33,113,145],"possible.":[35],"show":[37,55,124],"that":[38,59,125,234],"it":[39,60,75,126,235,278],"is":[40,61,72,106,127,135,163,170,221,236,256,262],"NP-hard":[41,62,128,237],"constantly":[49,245],"many":[50,246],"colors.":[51,247],"fact,":[53],"we":[54,271],"stronger":[57,275],"result":[58,169,261],"distinguish":[64,130],"whether":[65,131],"n":[70],"vertices":[71,110,142],"or":[74,137],"contains":[76],"no":[77],"independent":[78,284],"set":[79,285],"size":[81,287],"/spl":[82,89,151,159,288],"delta/n":[83],"for":[84,203],"arbitrarily":[86,165],"small":[87,166],"constant":[88],"delta/":[90],">":[91,161],"0.":[92],"maximization":[95],"goal":[105],"3":[112,144],"so":[114],"maximize":[117],"number":[119],"non-monochromatic":[121],"edges.":[122],"any":[138],"has":[146,273],"at":[147],"most":[148],"8/9":[149,182],"+":[150],"epsi/":[152,160],"fraction":[153,183],"edges":[156,186],"nonmonochromatic":[157],"where":[158],"0":[162],"constant.":[167],"This":[168],"tight":[171],"since":[172],"assigning":[173],"random":[175],"independently":[177,232],"every":[179],"vertex":[180],"makes":[181],"non-monochromatic.":[187],"These":[188],"results":[189],"are":[190],"obtained":[191],"via":[192],"new":[194,208],"construction":[195,209,220],"probabilistically":[198],"checkable":[199],"proof":[200],"system":[201],"(PCP)":[202],"NP.":[204],"develop":[206],"PCP":[212],"Outer":[213],"Verifier.":[214],"An":[215],"important":[216],"feature":[217],"smoothening":[222],"projection":[225],"maps.":[226],"Dinur,":[227],"Regev":[228],"and":[229,258],"Smyth":[230],"(2002)":[231],"showed":[233],"2-colorable":[241,257],"\"good":[250],"case\",":[251],"they":[254],"construct":[255,272],"hence":[259],"their":[260],"stronger.":[263],"\"bad":[266],"case\"":[267],"however,":[268],"property,":[276],"namely,":[277],"does":[279],"not":[280],"even":[281],"contain":[282],"delta/n.":[289]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}