{"id":"https://openalex.org/W4402612963","doi":"https://doi.org/10.1017/s0963548324000191","title":"List packing number of bounded degree graphs","display_name":"List packing number of bounded degree graphs","publication_year":2024,"publication_date":"2024-09-18","ids":{"openalex":"https://openalex.org/W4402612963","doi":"https://doi.org/10.1017/s0963548324000191"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548324000191","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1017/s0963548324000191","pdf_url":null,"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":null,"license_id":null,"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":"green","oa_url":"https://pure.uva.nl/ws/files/229995786/list-packing-number-of-bounded-degree-graphs.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015029543","display_name":"Stijn Cambie","orcid":"https://orcid.org/0000-0002-2385-1137"},"institutions":[{"id":"https://openalex.org/I4210104335","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565","country_code":"KR","type":"facility","lineage":["https://openalex.org/I4210104335"]},{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE","KR"],"is_corresponding":true,"raw_author_name":"Stijn Cambie","raw_affiliation_strings":["Department of Computer Science, KU Leuven Campus Kulak-Kortrijk, 8500 Kortrijk, Belgium","Extremal Combinatorics and Probability Group (ECOPRO), Institute for Basic Science (IBS), Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven Campus Kulak-Kortrijk, 8500 Kortrijk, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Extremal Combinatorics and Probability Group (ECOPRO), Institute for Basic Science (IBS), Daejeon, South Korea","institution_ids":["https://openalex.org/I4210104335"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031367873","display_name":"Wouter Cames van Batenburg","orcid":"https://orcid.org/0000-0001-8631-6222"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wouter Cames van Batenburg","raw_affiliation_strings":["Delft Institute of Applied Mathematics, Delft University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Delft Institute of Applied Mathematics, Delft University of Technology, Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020874001","display_name":"Ewan Davies","orcid":"https://orcid.org/0000-0002-2699-0976"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ewan Davies","raw_affiliation_strings":["Department of Computer Science, Colorado State University, Fort Collins, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Colorado State University, Fort Collins, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019911064","display_name":"Ross J. Kang","orcid":"https://orcid.org/0000-0002-4219-593X"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ross J. Kang","raw_affiliation_strings":["Korteweg\u2013de Vries Institute for Mathematics, University of Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Korteweg\u2013de Vries Institute for Mathematics, University of Amsterdam, Netherlands","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015029543"],"corresponding_institution_ids":["https://openalex.org/I4210104335","https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":0.7361,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.74401496,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":"33","issue":"6","first_page":"807","last_page":"828"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/bounded-function","display_name":"Bounded function","score":0.7022078633308411},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6868305206298828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5803762078285217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.494865357875824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3264372944831848},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.13159409165382385}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7022078633308411},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6868305206298828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5803762078285217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.494865357875824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3264372944831848},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.13159409165382385},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548324000191","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1017/s0963548324000191","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire/1a121f98-b12c-4a50-a102-b8f74ca5cca6","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/list-packing-number-of-bounded-degree-graphs(1a121f98-b12c-4a50-a102-b8f74ca5cca6).html","pdf_url":"https://pure.uva.nl/ws/files/229995786/list-packing-number-of-bounded-degree-graphs.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Cambie, S, Cames van Batenburg, W, Davies, E & Kang, R J 2024, 'List packing number of bounded degree graphs', Combinatorics Probability and Computing, vol. 33, no. 6, pp. 807-828. https://doi.org/10.1017/S0963548324000191","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:lirias2repo.kuleuven.be:20.500.12942/752219","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/handle/20.500.12942/752219","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Combinatorics Probability & Computing, vol. 33 (6), (807-828)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire/1a121f98-b12c-4a50-a102-b8f74ca5cca6","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/list-packing-number-of-bounded-degree-graphs(1a121f98-b12c-4a50-a102-b8f74ca5cca6).html","pdf_url":"https://pure.uva.nl/ws/files/229995786/list-packing-number-of-bounded-degree-graphs.pdf","source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Cambie, S, Cames van Batenburg, W, Davies, E & Kang, R J 2024, 'List packing number of bounded degree graphs', Combinatorics Probability and Computing, vol. 33, no. 6, pp. 807-828. https://doi.org/10.1017/S0963548324000191","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4402612963.pdf","grobid_xml":"https://content.openalex.org/works/W4402612963.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Abstract":[0],"We":[1,34],"investigate":[2],"the":[3,10,32,38,41,49,55,86,92,102],"list":[4,42,50,75,89,103],"packing":[5,43,76,90,104],"number":[6,44,77],"of":[7,27,40,48,57,88],"a":[8,98],"graph,":[9],"least":[11],"$k$":[12,18,29],"such":[13],"that":[14,47],"there":[15],"are":[16,35],"always":[17],"disjoint":[19],"proper":[20],"list-colourings":[21],"whenever":[22],"we":[23,64],"have":[24],"lists":[25],"all":[26],"size":[28],"associated":[30],"to":[31],"vertices.":[33],"curious":[36],"how":[37],"behaviour":[39],"contrasts":[45],"with":[46,70],"chromatic":[51],"number,":[52],"particularly":[53],"in":[54],"context":[56],"bounded":[58],"degree":[59,72],"graphs.":[60],"The":[61],"main":[62],"question":[63],"pursue":[65],"is":[66],"whether":[67],"every":[68],"graph":[69],"maximum":[71],"$\\Delta$":[73],"has":[74],"at":[78],"most":[79],"$\\Delta":[80],"+1$":[81],".":[82],"Our":[83],"results":[84],"highlight":[85],"subtleties":[87],"and":[91],"barriers":[93],"to,":[94],"for":[95,101],"example,":[96],"pursuing":[97],"Brooks\u2019-type":[99],"theorem":[100],"number.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}