{"id":"https://openalex.org/W2078652928","doi":"https://doi.org/10.1017/s0963548312000569","title":"Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree","display_name":"Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree","publication_year":2012,"publication_date":"2012-12-20","ids":{"openalex":"https://openalex.org/W2078652928","doi":"https://doi.org/10.1017/s0963548312000569","mag":"2078652928"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548312000569","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000569","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/6abd6697-cf39-49b5-a22e-d998f9fbf534","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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\u00dcHN","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK (e-mail:","University of Birmingham.*"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK (e-mail:","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"University of Birmingham.*","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035827198","display_name":"John Lapinskas","orcid":"https://orcid.org/0000-0003-3197-0854"},"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":"JOHN LAPINSKAS","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK (e-mail:","University of Birmingham.*"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK (e-mail:","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"University of Birmingham.*","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 B15 2TT, UK (e-mail:","University of Birmingham.*"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK (e-mail:","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"University of Birmingham.*","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":0.8925,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6997319,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"22","issue":"3","first_page":"394","last_page":"416"},"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.9998999834060669,"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.9998999834060669,"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.9977999925613403,"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/T11476","display_name":"Graph theory and applications","score":0.9975000023841858,"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.8457671403884888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.776146650314331},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6966171860694885},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48618215322494507},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.48209598660469055},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46283698081970215},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.45504653453826904}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8457671403884888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.776146650314331},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6966171860694885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48618215322494507},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.48209598660469055},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46283698081970215},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.45504653453826904},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":6,"locations":[{"id":"doi:10.1017/s0963548312000569","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548312000569","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:research-information.bris.ac.uk:openaire/6abd6697-cf39-49b5-a22e-d998f9fbf534","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/6abd6697-cf39-49b5-a22e-d998f9fbf534","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"K\u00fchn, D, Lapinskas, J A & Osthus, D 2013, 'Optimal packings of Hamilton cycles in graphs of high minimum degree', Combinatorics, Probability and Computing, vol. 22, pp. 394. < https://arxiv.org/pdf/1211.3263 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:2078652928","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1211.3263","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:oai:CiteSeerX.psu:10.1.1.372.7747","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.372.7747","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mat.bham.ac.uk/D.Osthus/mindeg_hamcyc7.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/5f0b8d42-8ad2-4de8-af84-6796afc3c3a6","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/5f0b8d42-8ad2-4de8-af84-6796afc3c3a6","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kuhn, D, Lapinskas, J & Osthus, D 2013, 'Optimal packings of Hamilton cycles in graphs of high minimum degree', Combinatorics, Probability and Computing, vol. 22, pp. 394-416.","raw_type":"article"},{"id":"doi:10.48550/arxiv.1211.3263","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1211.3263","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/6abd6697-cf39-49b5-a22e-d998f9fbf534","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/6abd6697-cf39-49b5-a22e-d998f9fbf534","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"K\u00fchn, D, Lapinskas, J A & Osthus, D 2013, 'Optimal packings of Hamilton cycles in graphs of high minimum degree', Combinatorics, Probability and Computing, vol. 22, pp. 394. < https://arxiv.org/pdf/1211.3263 >","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8140492080","display_name":null,"funder_award_id":"EP/J008087/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W184281306","https://openalex.org/W1968746414","https://openalex.org/W1971367602","https://openalex.org/W2018724658","https://openalex.org/W2066266229","https://openalex.org/W2077099816","https://openalex.org/W2081157042","https://openalex.org/W2087014485","https://openalex.org/W2087348204","https://openalex.org/W2114629872","https://openalex.org/W2949236759","https://openalex.org/W2951685678","https://openalex.org/W4256646394"],"related_works":["https://openalex.org/W1554423888","https://openalex.org/W2114629872","https://openalex.org/W2087014485","https://openalex.org/W2114755275","https://openalex.org/W1738676217","https://openalex.org/W2964204704","https://openalex.org/W3096277137","https://openalex.org/W3156400414","https://openalex.org/W3112340351","https://openalex.org/W2898902929","https://openalex.org/W2953123740","https://openalex.org/W3008000778","https://openalex.org/W3040670847","https://openalex.org/W2078983092","https://openalex.org/W3123726536","https://openalex.org/W2017923854","https://openalex.org/W2985914372","https://openalex.org/W2752146748","https://openalex.org/W2262634370","https://openalex.org/W2154031245"],"abstract_inverted_index":{"We":[0,86],"study":[1],"the":[2,34,40,43,62,105],"number":[3,63],"of":[4,42,64,74,82,94,121,128],"edge-disjoint":[5,65],"Hamilton":[6,66,126],"cycles":[7,67],"one":[8,48],"can":[9,49],"guarantee":[10,50],"in":[11,33,51],"a":[12,52,115],"sufficiently":[13],"large":[14],"graph":[15,53],"G":[16,93,101],"on":[17,54,114,125],"n":[18,55,83],"vertices":[19,56],"with":[20,57],"minimum":[21,58,95],"degree":[22,41,59,96],"\u03b4=(1/2+\u03b1)n.":[23],"For":[24],"any":[25],"constant":[26],"\u03b1>0,":[27],"we":[28,68],"give":[29],"an":[30],"optimal":[31],"answer":[32],"following":[35],"sense:":[36],"let":[37],"regeven(n,\u03b4)":[38,75],"denote":[39],"largest":[44],"even-regular":[45],"spanning":[46],"subgraph":[47],"\u03b4.":[60,85],"Then":[61],"find":[69],"equals":[70],"regeven(n,\u03b4)/2.":[71],"The":[72],"value":[73],"is":[76,102],"known":[77],"for":[78,108],"infinitely":[79],"many":[80],"values":[81],"and":[84,117,123],"also":[87],"extend":[88],"our":[89],"results":[90],"to":[91,104],"graphs":[92],"\u03b4":[97],"\u2265":[98],"n/2,":[99],"unless":[100],"close":[103],"extremal":[106],"constructions":[107],"Dirac's":[109],"theorem.":[110],"Our":[111],"proof":[112],"relies":[113],"recent":[116],"very":[118],"general":[119],"result":[120],"K\u00fchn":[122],"Osthus":[124],"decomposition":[127],"robustly":[129],"expanding":[130],"regular":[131],"graphs.":[132]},"counts_by_year":[{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}