{"id":"https://openalex.org/W2408494383","doi":"https://doi.org/10.1017/s0963548318000032","title":"Packing Graphs of Bounded Codegree","display_name":"Packing Graphs of Bounded Codegree","publication_year":2018,"publication_date":"2018-03-22","ids":{"openalex":"https://openalex.org/W2408494383","doi":"https://doi.org/10.1017/s0963548318000032","mag":"2408494383"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548318000032","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000032","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95F60E36C02E097BF6C15DB74E6CA903/S0963548318000032a.pdf/div-class-title-packing-graphs-of-bounded-codegree-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":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95F60E36C02E097BF6C15DB74E6CA903/S0963548318000032a.pdf/div-class-title-packing-graphs-of-bounded-codegree-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"WOUTER CAMES VAN BATENBURG","raw_affiliation_strings":["Department of Mathematics, Radboud University Nijmegen, PO Box 9010, 6500 GL Nijmegen, Netherlands (e-mail:","Radboud University Nijmegen"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Radboud University Nijmegen, PO Box 9010, 6500 GL Nijmegen, Netherlands (e-mail:","institution_ids":["https://openalex.org/I145872427"]},{"raw_affiliation_string":"Radboud University Nijmegen","institution_ids":["https://openalex.org/I145872427"]}]},{"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/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"ROSS J. KANG","raw_affiliation_strings":["Department of Mathematics, Radboud University Nijmegen, PO Box 9010, 6500 GL Nijmegen, Netherlands (e-mail:","Radboud University Nijmegen"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Radboud University Nijmegen, PO Box 9010, 6500 GL Nijmegen, Netherlands (e-mail:","institution_ids":["https://openalex.org/I145872427"]},{"raw_affiliation_string":"Radboud University Nijmegen","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031367873"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02873204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"5","first_page":"725","last_page":"740"},"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.9995999932289124,"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.9995999932289124,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9947999715805054,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8310741186141968},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6806510090827942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.650234580039978},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6210124492645264},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5623067617416382},{"id":"https://openalex.org/keywords/injective-function","display_name":"Injective function","score":0.5559124946594238},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5164149403572083},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4808381497859955},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4644261598587036},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.42565327882766724},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3775940239429474}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8310741186141968},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6806510090827942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.650234580039978},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6210124492645264},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5623067617416382},{"id":"https://openalex.org/C128107574","wikidata":"https://www.wikidata.org/wiki/Q182003","display_name":"Injective function","level":2,"score":0.5559124946594238},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5164149403572083},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4808381497859955},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4644261598587036},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.42565327882766724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3775940239429474},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548318000032","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000032","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95F60E36C02E097BF6C15DB74E6CA903/S0963548318000032a.pdf/div-class-title-packing-graphs-of-bounded-codegree-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:arXiv.org:1605.05599","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1605.05599","pdf_url":"https://arxiv.org/pdf/1605.05599","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2408494383","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1605.05599.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1605.05599","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1605.05599","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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"}],"best_oa_location":{"id":"doi:10.1017/s0963548318000032","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548318000032","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/95F60E36C02E097BF6C15DB74E6CA903/S0963548318000032a.pdf/div-class-title-packing-graphs-of-bounded-codegree-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/G4623480208","display_name":null,"funder_award_id":"NWO Vidi","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8688676036","display_name":null,"funder_award_id":"639.032.614","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"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/W2408494383.pdf","grobid_xml":"https://content.openalex.org/works/W2408494383.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1979767977","https://openalex.org/W2001660893","https://openalex.org/W2006001677","https://openalex.org/W2015832457","https://openalex.org/W2034163816","https://openalex.org/W2039027438","https://openalex.org/W2054349075","https://openalex.org/W2064884497","https://openalex.org/W2082497622","https://openalex.org/W2083188650","https://openalex.org/W2161551214","https://openalex.org/W2780776728","https://openalex.org/W2963435510","https://openalex.org/W4210634265"],"related_works":["https://openalex.org/W1979767977","https://openalex.org/W2613719104","https://openalex.org/W2963137122","https://openalex.org/W3150080466","https://openalex.org/W3197357832","https://openalex.org/W2283699892","https://openalex.org/W2943357508","https://openalex.org/W2985045181","https://openalex.org/W2186542108","https://openalex.org/W2004627446","https://openalex.org/W3209002032","https://openalex.org/W2187091971","https://openalex.org/W2962937261","https://openalex.org/W2001998099","https://openalex.org/W2096875564","https://openalex.org/W2291244577","https://openalex.org/W3212235906","https://openalex.org/W3109059064","https://openalex.org/W2041188826","https://openalex.org/W3102510373"],"abstract_inverted_index":{"Two":[0],"graphs":[1],"G":[2,5,52,57,67,70,85,88,104,119,127,132,137,148,151,162],"1":[3,53,68,86,105,120,133,145,149],"and":[4,43,69,117,150],"2":[6,58,71,89,101,128,138,152,163],"on":[7],"n":[8,25,63,143],"vertices":[9],"are":[10,35],"said":[11],"to":[12,41],"pack":[13],"if":[14,50,103,160],"there":[15],"exist":[16],"injective":[17],"mappings":[18],"of":[19,31,77,109,167],"their":[20,32],"vertex":[21],"sets":[22,34],"into":[23],"[":[24],"]":[26],"such":[27],"that":[28,49,84,102,147],"the":[29,75,81,110,168],"images":[30],"edge":[33],"disjoint.":[36],"A":[37],"longstanding":[38],"conjecture":[39],"due":[40],"Bollob\u00e1s":[42],"Eldridge":[44],"and,":[45],"independently,":[46],"Catlin,":[47],"asserts":[48],"(\u0394(":[51,131],")":[54,59,121,134,139],"+":[55,60,64,135,140,144],"1)(\u0394(":[56,136],"1)":[61,141],"\u2a7d":[62,142],"1,":[65],"then":[66,130],"pack.":[72,153],"We":[73,154],"consider":[74],"validity":[76],"this":[78],"assertion":[79],"under":[80],"additional":[82],"assumption":[83],"or":[87],"has":[90],"bounded":[91],"codegree.":[92],"In":[93],"particular,":[94],"we":[95],"prove":[96],"for":[97],"all":[98],"t":[99,116,124],"\u2a7e":[100,177],"contains":[106,164],"no":[107,165],"copy":[108,166],"complete":[111,169],"bipartite":[112],"graph":[113,171],"K":[114,172],"2,":[115],"\u0394(":[118,126],">":[122],"17":[123],"\u00b7":[125],"),":[129],"implies":[146],"also":[155],"provide":[156],"a":[157],"mild":[158],"improvement":[159],"moreover":[161],"tripartite":[170],"1,1,":[173],"s":[174,176],",":[175],"1.":[178]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}