{"id":"https://openalex.org/W2047171329","doi":"https://doi.org/10.1007/s00493-014-2956-z","title":"Optimal covers with Hamilton cycles in random graphs","display_name":"Optimal covers with Hamilton cycles in random graphs","publication_year":2014,"publication_date":"2014-06-23","ids":{"openalex":"https://openalex.org/W2047171329","doi":"https://doi.org/10.1007/s00493-014-2956-z","mag":"2047171329"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-014-2956-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-014-2956-z","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/9deedf34-021b-468c-8195-c13ba72f434c","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072848658","display_name":"Dan Hefetz","orcid":"https://orcid.org/0000-0001-8923-3879"},"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":true,"raw_author_name":"Dan Hefetz","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK","School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT","institution_ids":["https://openalex.org/I79619799"]}]},{"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, B15 2TT, UK","School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT","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/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"John Lapinskas","raw_affiliation_strings":["Department of Computer Science, Wolfson Building, Park Road, Oxford, OX1 3QD, UK","Department of Computer Science, Wolfson Building, Oxford, UK OX1 3QD#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Wolfson Building, Park Road, Oxford, OX1 3QD, UK","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Department of Computer Science, Wolfson Building, Oxford, UK OX1 3QD#TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"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","School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]},{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK B15 2TT","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072848658"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":3.6574,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.92830307,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"5","first_page":"573","last_page":"596"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9969000220298767,"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.9962000250816345,"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.9030690789222717},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8452472686767578},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6304814219474792},{"id":"https://openalex.org/keywords/complete-graph","display_name":"Complete graph","score":0.5276747345924377},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5150861144065857},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46869659423828125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35743218660354614}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9030690789222717},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8452472686767578},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6304814219474792},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.5276747345924377},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5150861144065857},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46869659423828125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35743218660354614}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s00493-014-2956-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-014-2956-z","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/0198dc28-c37a-44e3-988d-f66474280bd9","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/0198dc28-c37a-44e3-988d-f66474280bd9","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hefetz, D, K\u00fchn, D, Lapinskas, J & Osthus, D 2014, 'Optimal covers with Hamilton cycles in random graphs', Combinatorica, vol. 34, no. 5, pp. 573\u2013596. https://doi.org/10.1007/s00493-014-2956-z","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/9deedf34-021b-468c-8195-c13ba72f434c","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/9deedf34-021b-468c-8195-c13ba72f434c","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":"Hefetz, D, K\u00fchn, D, Lapinskas, J A & Osthus, D 2014, 'Optimal covers with Hamilton cycles in random graphs', Combinatorica, vol. 34, no. 5, pp. 573-596. < https://arxiv.org/pdf/1203.3868 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/9deedf34-021b-468c-8195-c13ba72f434c","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/9deedf34-021b-468c-8195-c13ba72f434c","pdf_url":"https://arxiv.org/pdf/1203.3868","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hefetz, D, K\u00fchn, D, Lapinskas, J A & Osthus, D 2014, 'Optimal covers with Hamilton cycles in random graphs', Combinatorica, vol. 34, no. 5, pp. 573-596. < https://arxiv.org/pdf/1203.3868 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.372.6231","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.372.6231","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/randomcover6.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.755.330","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.755.330","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1203.3868.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/0198dc28-c37a-44e3-988d-f66474280bd9","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/portal/en/publications/optimal-covers-with-hamilton-cycles-in-random-graphs(0198dc28-c37a-44e3-988d-f66474280bd9).html","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":"Hefetz, D, K\u00fchn, D, Lapinskas, J & Osthus, D 2014, 'Optimal covers with Hamilton cycles in random graphs', Combinatorica, vol. 34, no. 5, pp. 573\u2013596. https://doi.org/10.1007/s00493-014-2956-z","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/9deedf34-021b-468c-8195-c13ba72f434c","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/9deedf34-021b-468c-8195-c13ba72f434c","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":"Hefetz, D, K\u00fchn, D, Lapinskas, J A & Osthus, D 2014, 'Optimal covers with Hamilton cycles in random graphs', Combinatorica, vol. 34, no. 5, pp. 573-596. < https://arxiv.org/pdf/1203.3868 >","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3207356259","display_name":null,"funder_award_id":"2007\u20132013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G896728979","display_name":null,"funder_award_id":"FP/2007/2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W23397926","https://openalex.org/W1482601444","https://openalex.org/W1923601119","https://openalex.org/W2005211578","https://openalex.org/W2006567887","https://openalex.org/W2010688605","https://openalex.org/W2016267660","https://openalex.org/W2066266229","https://openalex.org/W2081157042","https://openalex.org/W2087014485","https://openalex.org/W2087348204","https://openalex.org/W2088622619","https://openalex.org/W2125752997","https://openalex.org/W2140606499","https://openalex.org/W2317309498","https://openalex.org/W2478722229","https://openalex.org/W2622381546","https://openalex.org/W2905110430","https://openalex.org/W3100625388","https://openalex.org/W3144881883","https://openalex.org/W4242336842","https://openalex.org/W4256646394"],"related_works":["https://openalex.org/W2767587315","https://openalex.org/W2546705119","https://openalex.org/W2950385387","https://openalex.org/W2152478214","https://openalex.org/W2130209831","https://openalex.org/W2963699585","https://openalex.org/W2086786817","https://openalex.org/W2952110281","https://openalex.org/W2963116645","https://openalex.org/W8458634"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}