{"id":"https://openalex.org/W2134276604","doi":"https://doi.org/10.37236/448","title":"A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of $k$-partite $k$-uniform Hypergraphs","display_name":"A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of $k$-partite $k$-uniform Hypergraphs","publication_year":2010,"publication_date":"2010-12-10","ids":{"openalex":"https://openalex.org/W2134276604","doi":"https://doi.org/10.37236/448","mag":"2134276604"},"language":"en","primary_location":{"id":"doi:10.37236/448","is_oa":true,"landing_page_url":"https://doi.org/10.37236/448","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r176/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r176/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029447093","display_name":"Uwe Schauz","orcid":"https://orcid.org/0000-0002-3116-9402"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"Uwe Schauz","raw_affiliation_strings":["Department of Mathematics and Statistics King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","King Fahd University of Petroleum and Minerals,"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics King Fahd University of Petroleum and Minerals Dhahran 31261, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]},{"raw_affiliation_string":"King Fahd University of Petroleum and Minerals,","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029447093"],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":4.1003,"has_fulltext":true,"cited_by_count":36,"citation_normalized_percentile":{"value":0.94070649,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"17","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9987000226974487,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9987000226974487,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8547431230545044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8183491230010986},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7438970804214478},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5490310192108154},{"id":"https://openalex.org/keywords/subject","display_name":"Subject (documents)","score":0.4147523045539856},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.373889684677124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15133407711982727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10967236757278442}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8547431230545044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8183491230010986},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7438970804214478},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5490310192108154},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.4147523045539856},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.373889684677124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15133407711982727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10967236757278442},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/448","is_oa":true,"landing_page_url":"https://doi.org/10.37236/448","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r176/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.187.7567","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.7567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_17/PDF/v17i1r176.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/448","is_oa":true,"landing_page_url":"https://doi.org/10.37236/448","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v17i1r176/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322323","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2134276604.pdf","grobid_xml":"https://content.openalex.org/works/W2134276604.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W3297276","https://openalex.org/W1515228725","https://openalex.org/W1559380822","https://openalex.org/W1587621605","https://openalex.org/W1598828859","https://openalex.org/W1972913697","https://openalex.org/W1988233594","https://openalex.org/W2059732232","https://openalex.org/W2072414205","https://openalex.org/W2128187567","https://openalex.org/W2156678756","https://openalex.org/W2280936352","https://openalex.org/W2999223002"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2371352078","https://openalex.org/W2077383796","https://openalex.org/W2953461625","https://openalex.org/W4388258507","https://openalex.org/W4390409907","https://openalex.org/W2586280130","https://openalex.org/W4221143622","https://openalex.org/W1981723335","https://openalex.org/W2089088747"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,32,57],"list":[3,43],"coloring":[4],"number":[5],"of":[6,13,56],"$k$-uniform":[7],"$k$-partite":[8],"hypergraphs.":[9],"Answering":[10],"a":[11,19,52],"question":[12],"Ramamurthi":[14],"and":[15,26],"West,":[16],"we":[17,50],"present":[18],"new":[20,53],"upper":[21],"bound":[22,28],"which":[23],"generalizes":[24],"Alon":[25],"Tarsi's":[27],"for":[29,39],"bipartite":[30],"graphs,":[31],"case":[33],"$k=2$.":[34],"Our":[35],"results":[36],"hold":[37],"even":[38],"paintability":[40],"(on\"":[41],"line":[42],"colorability).":[44],"To":[45],"prove":[46],"this":[47],"additional":[48],"strengthening,":[49],"provide":[51],"subject\"=specific":[54],"version":[55],"Combinatorial":[58],"Nullstellensatz.":[59]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}