{"id":"https://openalex.org/W3207412727","doi":"https://doi.org/10.1017/s0963548322000116","title":"Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor","display_name":"Improved lower bound for the list chromatic number of graphs with no <i>K<sub>t</sub></i> minor","publication_year":2022,"publication_date":"2022-05-30","ids":{"openalex":"https://openalex.org/W3207412727","doi":"https://doi.org/10.1017/s0963548322000116","mag":"3207412727"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548322000116","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548322000116","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8132D67EC14954FEFEF399184D7C9A8B/S0963548322000116a.pdf/div-class-title-improved-lower-bound-for-the-list-chromatic-number-of-graphs-with-no-span-class-italic-k-span-class-sub-t-span-span-minor-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8132D67EC14954FEFEF399184D7C9A8B/S0963548322000116a.pdf/div-class-title-improved-lower-bound-for-the-list-chromatic-number-of-graphs-with-no-span-class-italic-k-span-class-sub-t-span-span-minor-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048260458","display_name":"Raphael Steiner","orcid":"https://orcid.org/0000-0002-4234-6136"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Raphael Steiner","raw_affiliation_strings":["Institute of Theoretical Computer Science, ETH Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Theoretical Computer Science, ETH Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048260458"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":1.0058,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77311547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"6","first_page":"1070","last_page":"1075"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9821000099182129,"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.9821000099182129,"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.9426000118255615,"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.8847218751907349},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.8476777076721191},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.7390154004096985},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6996241211891174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6498894095420837},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.6231083869934082},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5397622585296631},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4245569109916687}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8847218751907349},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.8476777076721191},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.7390154004096985},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6996241211891174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6498894095420837},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.6231083869934082},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5397622585296631},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4245569109916687},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548322000116","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548322000116","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8132D67EC14954FEFEF399184D7C9A8B/S0963548322000116a.pdf/div-class-title-improved-lower-bound-for-the-list-chromatic-number-of-graphs-with-no-span-class-italic-k-span-class-sub-t-span-span-minor-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:research-collection.ethz.ch:20.500.11850/551514","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/551514","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability & Computing, 31 (6)","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.3929/ethz-b-000551514","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000551514","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.1017/s0963548322000116","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548322000116","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/8132D67EC14954FEFEF399184D7C9A8B/S0963548322000116a.pdf/div-class-title-improved-lower-bound-for-the-list-chromatic-number-of-graphs-with-no-span-class-italic-k-span-class-sub-t-span-span-minor-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3207412727.pdf","grobid_xml":"https://content.openalex.org/works/W3207412727.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W143450761","https://openalex.org/W1520619927","https://openalex.org/W1566410171","https://openalex.org/W1656795039","https://openalex.org/W1978082980","https://openalex.org/W2027399467","https://openalex.org/W2047993669","https://openalex.org/W2049053276","https://openalex.org/W2055443873","https://openalex.org/W2071321409","https://openalex.org/W2089023036","https://openalex.org/W2148360835","https://openalex.org/W2170758948","https://openalex.org/W2504259738","https://openalex.org/W2963148883","https://openalex.org/W3018833318","https://openalex.org/W3036858539","https://openalex.org/W3037938497","https://openalex.org/W3093338385","https://openalex.org/W3132307481","https://openalex.org/W3190183031","https://openalex.org/W4210442307","https://openalex.org/W4212970601","https://openalex.org/W6633885998","https://openalex.org/W6637159859"],"related_works":["https://openalex.org/W2999044462","https://openalex.org/W2883170221","https://openalex.org/W4368339666","https://openalex.org/W4286901599","https://openalex.org/W3207412727","https://openalex.org/W4243250875","https://openalex.org/W2952342369","https://openalex.org/W4291863732","https://openalex.org/W2067688212","https://openalex.org/W2042289434"],"abstract_inverted_index":{"Abstract":[0],"Hadwiger\u2019s":[1,22],"conjecture":[2,23,104],"asserts":[3],"that":[4,17,40,47,67,79,122],"every":[5,48],"graph":[6,49],"without":[7],"a":[8,43],"$K_t$":[9,52,89],"-minor":[10,53,90],"is":[11,15,91,105],"$(t-1)$":[12],"-colourable.":[13],"It":[14],"known":[16],"the":[18,74,80,102,109,133],"exact":[19],"version":[20],"of":[21,85],"does":[24],"not":[25],"extend":[26],"to":[27],"list":[28,55,82],"colouring,":[29],"but":[30],"it":[31],"has":[32,54],"been":[33],"conjectured":[34,66],"by":[35,114],"Kawarabayashi":[36],"and":[37,96,117],"Mohar":[38],"(2007)":[39],"there":[41],"exists":[42],"constant":[44],"$c$":[45],"such":[46],"with":[50,87],"no":[51,88],"chromatic":[56,83],"number":[57,84],"at":[58,92],"most":[59],"$ct$":[60],".":[61,72,126],"More":[62],"specifically,":[63],"they":[64],"also":[65],"this":[68],"holds":[69],"for":[70],"$c=\\frac{3}{2}$":[71],"Refuting":[73],"latter":[75],"conjecture,":[76],"we":[77],"show":[78],"maximum":[81],"graphs":[86],"least":[93],"$(2-o(1))t$":[94],",":[95],"hence":[97],"$c":[98,123],"\\ge":[99,124],"2$":[100],"in":[101],"above":[103],"necessary.":[106],"This":[107],"improves":[108],"previous":[110],"best":[111],"lower":[112],"bound":[113],"Bar\u00e1t,":[115],"Joret":[116],"Wood":[118],"(2011),":[119],"who":[120],"proved":[121],"\\frac{4}{3}$":[125],"Our":[127],"lower-bound":[128],"examples":[129],"are":[130],"obtained":[131],"via":[132],"probabilistic":[134],"method.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}