{"id":"https://openalex.org/W2139181956","doi":"https://doi.org/10.37236/1670","title":"On a Theorem of Erd\u0151s, Rubin, and Taylor on Choosability of Complete Bipartite Graphs","display_name":"On a Theorem of Erd\u0151s, Rubin, and Taylor on Choosability of Complete Bipartite Graphs","publication_year":2002,"publication_date":"2002-08-13","ids":{"openalex":"https://openalex.org/W2139181956","doi":"https://doi.org/10.37236/1670","mag":"2139181956"},"language":"en","primary_location":{"id":"doi:10.37236/1670","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1670","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1n9/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":false,"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":"bronze","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1n9/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080894223","display_name":"Alexandr Kostochka","orcid":"https://orcid.org/0000-0002-6363-3804"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alexandr Kostochka","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL 61801 and Institute of Mathematics, Novosibirsk 630090, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL 61801 and Institute of Mathematics, Novosibirsk 630090, Russia","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080894223"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":25,"citation_normalized_percentile":{"value":0.21947353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.992900013923645,"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.986299991607666,"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/mathematics","display_name":"Mathematics","score":0.8933093547821045},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8132646679878235},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7866259813308716},{"id":"https://openalex.org/keywords/robertson\u2013seymour-theorem","display_name":"Robertson\u2013Seymour theorem","score":0.6716773509979248},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6465902924537659},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4982125759124756},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4628777503967285},{"id":"https://openalex.org/keywords/extremal-graph-theory","display_name":"Extremal graph theory","score":0.45846471190452576},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43943488597869873},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.25226497650146484},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18562105298042297},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.11877182126045227}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8933093547821045},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8132646679878235},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7866259813308716},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.6716773509979248},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6465902924537659},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4982125759124756},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4628777503967285},{"id":"https://openalex.org/C12595997","wikidata":"https://www.wikidata.org/wiki/Q739245","display_name":"Extremal graph theory","level":5,"score":0.45846471190452576},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43943488597869873},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.25226497650146484},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18562105298042297},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.11877182126045227}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/1670","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1670","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1n9/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":false,"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"}],"best_oa_location":{"id":"doi:10.37236/1670","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1670","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1n9/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":false,"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":[{"score":0.46000000834465027,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G5109442184","display_name":"Colorings and List Colorings:  Contrasts and Similarities","funder_award_id":"0099608","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2139181956.pdf","grobid_xml":"https://content.openalex.org/works/W2139181956.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1976087213","https://openalex.org/W1977676492","https://openalex.org/W1995615993","https://openalex.org/W2039241885","https://openalex.org/W2055108763","https://openalex.org/W2130108851","https://openalex.org/W2134754301","https://openalex.org/W2144339433","https://openalex.org/W6600653764"],"related_works":["https://openalex.org/W2107875203","https://openalex.org/W4294294408","https://openalex.org/W2913147187","https://openalex.org/W3037054849","https://openalex.org/W1995353327","https://openalex.org/W2026407105","https://openalex.org/W2147621675","https://openalex.org/W3023093332","https://openalex.org/W4297818844","https://openalex.org/W2021149991"],"abstract_inverted_index":{"Erd\u0151s,":[0],"Rubin,":[1],"and":[2,21,54],"Taylor":[3],"found":[4],"a":[5,13],"nice":[6],"correspondence":[7],"between":[8],"the":[9,22,36],"minimum":[10,23],"order":[11],"of":[12,25],"complete":[14,51,55],"bipartite":[15],"graph":[16],"that":[17,31],"is":[18,32],"not":[19,33],"$r$-choosable":[20],"number":[24],"edges":[26],"in":[27],"an":[28],"$r$-uniform":[29],"hypergraph":[30],"$2$-colorable":[34],"(in":[35],"ordinary":[37],"sense).":[38],"In":[39],"this":[40],"note":[41],"we":[42],"use":[43],"their":[44],"ideas":[45],"to":[46],"derive":[47],"similar":[48],"correspondences":[49],"for":[50],"$k$-partite":[52,57],"graphs":[53],"$k$-uniform":[56],"hypergraphs.":[58]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}