{"id":"https://openalex.org/W4388556993","doi":"https://doi.org/10.1017/s0963548323000299","title":"A special case of Vu\u2019s conjecture: colouring nearly disjoint graphs of bounded maximum degree","display_name":"A special case of Vu\u2019s conjecture: colouring nearly disjoint graphs of bounded maximum degree","publication_year":2023,"publication_date":"2023-11-10","ids":{"openalex":"https://openalex.org/W4388556993","doi":"https://doi.org/10.1017/s0963548323000299"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548323000299","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s0963548323000299","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/36F065432B49706CF7DE11F1C1457B12/S0963548323000299a.pdf/div-class-title-a-special-case-of-vu-s-conjecture-colouring-nearly-disjoint-graphs-of-bounded-maximum-degree-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"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/36F065432B49706CF7DE11F1C1457B12/S0963548323000299a.pdf/div-class-title-a-special-case-of-vu-s-conjecture-colouring-nearly-disjoint-graphs-of-bounded-maximum-degree-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086956409","display_name":"Tom Kelly","orcid":"https://orcid.org/0000-0002-4040-1648"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tom Kelly","raw_affiliation_strings":["School of Mathematics, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0002-4040-1648","affiliations":[{"raw_affiliation_string":"School of Mathematics, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051475433","display_name":"Daniela K\u00fchn","orcid":"https://orcid.org/0000-0002-2448-1510"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniela K\u00fchn","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009459540","display_name":"Deryk Osthus","orcid":"https://orcid.org/0000-0002-3059-4298"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Deryk Osthus","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086956409"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.6696,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64442962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"33","issue":"2","first_page":"179","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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.8613735437393188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8193930387496948},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7880765199661255},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7648468017578125},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6949330568313599},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6947293877601624},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6044659614562988},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.5295337438583374},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4749622046947479},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43889039754867554},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07040020823478699},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.04857400059700012}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8613735437393188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8193930387496948},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7880765199661255},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7648468017578125},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6949330568313599},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6947293877601624},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6044659614562988},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.5295337438583374},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4749622046947479},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43889039754867554},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07040020823478699},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.04857400059700012},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s0963548323000299","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s0963548323000299","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/36F065432B49706CF7DE11F1C1457B12/S0963548323000299a.pdf/div-class-title-a-special-case-of-vu-s-conjecture-colouring-nearly-disjoint-graphs-of-bounded-maximum-degree-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:pure.atira.dk:publications/41df664b-1a83-4478-832a-c3c560461441","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/41df664b-1a83-4478-832a-c3c560461441","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/212268987/a-special-case-of-vus-conjecture-colouring-nearly-disjoint-graphs-of-bounded-maximum-degree.pdf","source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kelly , T , K\u00fchn , D & Osthus , D 2023 , ' A special case of Vu\u2019s conjecture: colouring nearly disjoint graphs of bounded maximum degree ' , Combinatorics, Probability and Computing , pp. 1-17 . https://doi.org/10.1017/S0963548323000299","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s0963548323000299","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1017/s0963548323000299","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/36F065432B49706CF7DE11F1C1457B12/S0963548323000299a.pdf/div-class-title-a-special-case-of-vu-s-conjecture-colouring-nearly-disjoint-graphs-of-bounded-maximum-degree-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":[{"id":"https://openalex.org/G1390963937","display_name":null,"funder_award_id":"EP/S00100X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4491134239","display_name":null,"funder_award_id":"EP/N019504/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4388556993.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W80618698","https://openalex.org/W1973286131","https://openalex.org/W1984375054","https://openalex.org/W2024769658","https://openalex.org/W2042703645","https://openalex.org/W2046229563","https://openalex.org/W2053777090","https://openalex.org/W2119305988","https://openalex.org/W2152427009","https://openalex.org/W2169821423","https://openalex.org/W2738901344","https://openalex.org/W3086542228","https://openalex.org/W3113763809","https://openalex.org/W3168462725","https://openalex.org/W3174655151","https://openalex.org/W3207089107","https://openalex.org/W4207028927","https://openalex.org/W4210330004","https://openalex.org/W4246490489","https://openalex.org/W4251499437","https://openalex.org/W4281739882","https://openalex.org/W4292027191","https://openalex.org/W6781566182","https://openalex.org/W6807315646"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2348092930","https://openalex.org/W3161230432","https://openalex.org/W2171695875","https://openalex.org/W4308716484","https://openalex.org/W26693340","https://openalex.org/W2950817880","https://openalex.org/W2536813416"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"collection":[2],"of":[3,11,30,60,72,89,92,103,107,129,148,156],"graphs":[4,29,62],"is":[5,54,76],"nearly":[6,27],"disjoint":[7,28],"if":[8,22,46],"every":[9,42],"pair":[10],"them":[12],"intersects":[13],"in":[14,56,145],"at":[15,33,57,77],"most":[16,34,58,78],"one":[17],"vertex.":[18],"We":[19],"prove":[20],"that":[21,151],"$G_1,":[23,63],"\\dots,":[24,64],"G_m$":[25,65],"are":[26],"maximum":[31,109],"degree":[32],"$D$":[35],",":[36,45,66],"then":[37,67],"the":[38,61,68,99,117,146],"following":[39],"holds.":[40],"For":[41],"fixed":[43],"$C$":[44,59],"each":[47],"vertex":[48],"$v":[49],"\\in":[50],"\\bigcup":[51],"_{i=1}^m":[52,74],"V(G_i)$":[53],"contained":[55],"(list)":[69],"chromatic":[70,101,121],"number":[71,122],"$\\bigcup":[73],"G_i$":[75],"$D":[79],"+":[80],"o(D)$":[81],".":[82],"This":[83],"result":[84,114,128,137,144,155],"confirms":[85],"a":[86,90,126,139,154],"special":[87],"case":[88],"conjecture":[91],"Vu":[93],"and":[94,123,131,133,158],"generalizes":[95],"Kahn\u2019s":[96],"bound":[97],"on":[98],"list":[100,142],"index":[102],"linear":[104],"uniform":[105],"hypergraphs":[106],"bounded":[108],"degree.":[110],"In":[111],"fact,":[112],"this":[113,136],"holds":[115],"for":[116],"correspondence":[118],"(or":[119],"DP)":[120],"thus":[124],"implies":[125,153],"recent":[127],"Molloy":[130],"Postle,":[132],"we":[134],"derive":[135],"from":[138],"more":[140],"general":[141],"colouring":[143],"setting":[147],"\u2018colour":[149],"degrees\u2019":[150],"also":[152],"Reed":[157],"Sudakov.":[159]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-01-20T17:24:06.736184","created_date":"2025-10-10T00:00:00"}