{"id":"https://openalex.org/W2304001333","doi":"https://doi.org/10.37236/7418","title":"Hamilton Cycles in Sparse Robustly Expanding Digraphs","display_name":"Hamilton Cycles in Sparse Robustly Expanding Digraphs","publication_year":2018,"publication_date":"2018-09-07","ids":{"openalex":"https://openalex.org/W2304001333","doi":"https://doi.org/10.37236/7418","mag":"2304001333"},"language":"en","primary_location":{"id":"doi:10.37236/7418","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7418","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.37236/7418","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022659483","display_name":"Allan Lo","orcid":"https://orcid.org/0000-0001-9767-2863"},"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":"Allan Lo","raw_affiliation_strings":["University of Birmingham","UNIVERSITY OF BIRMINGHAM"],"affiliations":[{"raw_affiliation_string":"University of Birmingham","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/A5031655569","display_name":"Viresh Patel","orcid":"https://orcid.org/0000-0001-8047-350X"},"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"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Viresh Patel","raw_affiliation_strings":["University of Amsterdam"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022659483"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02311056,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"3","first_page":null,"last_page":null},"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9976000189781189,"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/lemma","display_name":"Lemma (botany)","score":0.8493021726608276},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7912073135375977},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5687239170074463},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.5670726299285889},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5276148319244385},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5172496438026428},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48260653018951416},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3766153156757355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3700277805328369},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.18213510513305664},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12680381536483765}],"concepts":[{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.8493021726608276},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7912073135375977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5687239170074463},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.5670726299285889},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5276148319244385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5172496438026428},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48260653018951416},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3766153156757355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3700277805328369},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.18213510513305664},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12680381536483765},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.37236/7418","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7418","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1507.04472","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.04472","pdf_url":"https://arxiv.org/pdf/1507.04472","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":"pmh:oai:dare.uva.nl:openaire/bbcef3ef-a3a1-4ca3-a80b-84934c9f7071","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/hamilton-cycles-in-sparse-robustly-expanding-digraphs(bbcef3ef-a3a1-4ca3-a80b-84934c9f7071).html","pdf_url":"https://pure.uva.nl/ws/files/31330252/Hamilton_cycles_in_sparse_robustly_expanding_digraphs.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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lo, A & Patel, V 2018, 'Hamilton cycles in sparse robustly expanding digraphs', Electronic Journal of Combinatorics, vol. 25, no. 3, P3.44. < https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p44 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/2877fe26-d9a3-4279-bb53-ce0a35668932","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1507.04472","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lo , A & Patel , V 2018 , ' Hamilton cycles in sparse robustly expanding digraphs ' , Electronic Journal of Combinatorics , vol. 25 , no. 3 , #P3.44 . < https://arxiv.org/pdf/1507.04472 >","raw_type":"article"},{"id":"pmh:oai:dare.uva.nl:publications/bbcef3ef-a3a1-4ca3-a80b-84934c9f7071","is_oa":false,"landing_page_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p44","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lo, A & Patel, V 2018, 'Hamilton cycles in sparse robustly expanding digraphs', Electronic Journal of Combinatorics, vol. 25, no. 3, P3.44. < https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p44 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/2877fe26-d9a3-4279-bb53-ce0a35668932","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/2877fe26-d9a3-4279-bb53-ce0a35668932","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":"Lo, A & Patel, V 2018, 'Hamilton cycles in sparse robustly expanding digraphs', Electronic Journal of Combinatorics, vol. 25, no. 3, #P3.44. < https://arxiv.org/pdf/1507.04472 >","raw_type":"article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/bbcef3ef-a3a1-4ca3-a80b-84934c9f7071","is_oa":true,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/hamilton-cycles-in-sparse-robustly-expanding-digraphs(bbcef3ef-a3a1-4ca3-a80b-84934c9f7071).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"Electronic Journal of Combinatorics, 25(3):P3.44. Electronic Journal of Combinatorics","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1507.04472","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1507.04472","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"},{"id":"mag:2304001333","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.37236/7418","is_oa":true,"landing_page_url":"https://doi.org/10.37236/7418","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1399324874","display_name":null,"funder_award_id":"024.002.00","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G2761285720","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4447653093","display_name":null,"funder_award_id":"Network","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5365867299","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7312277612","display_name":"Quasirandomness in Graphs and Hypergraphs","funder_award_id":"258345","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8051717526","display_name":null,"funder_award_id":"Grant","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"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W217363743","https://openalex.org/W1493850023","https://openalex.org/W1518401101","https://openalex.org/W1554423888","https://openalex.org/W1639593279","https://openalex.org/W1913884843","https://openalex.org/W1935724303","https://openalex.org/W1971367602","https://openalex.org/W1973167211","https://openalex.org/W2000252962","https://openalex.org/W2009232680","https://openalex.org/W2018724658","https://openalex.org/W2036286064","https://openalex.org/W2068871408","https://openalex.org/W2081157042","https://openalex.org/W2087014485","https://openalex.org/W2088312380","https://openalex.org/W2099989374","https://openalex.org/W2106107541","https://openalex.org/W2109266036","https://openalex.org/W2110787567","https://openalex.org/W2113407082","https://openalex.org/W2116986058","https://openalex.org/W2125752997","https://openalex.org/W2138256399","https://openalex.org/W2157346439","https://openalex.org/W2164680149","https://openalex.org/W2233163411","https://openalex.org/W2294714952","https://openalex.org/W2611093227","https://openalex.org/W2952719763","https://openalex.org/W3100779871","https://openalex.org/W3101429032","https://openalex.org/W3105339626"],"related_works":["https://openalex.org/W2962967076","https://openalex.org/W2949184891","https://openalex.org/W632755663","https://openalex.org/W2163453622","https://openalex.org/W2770992319","https://openalex.org/W3095152547","https://openalex.org/W2953152412","https://openalex.org/W1698804677","https://openalex.org/W2021064202","https://openalex.org/W1538578000","https://openalex.org/W3101333414","https://openalex.org/W2949231286","https://openalex.org/W2993699426","https://openalex.org/W86453439","https://openalex.org/W2531503199","https://openalex.org/W2950953461","https://openalex.org/W2949551957","https://openalex.org/W2268993551","https://openalex.org/W2296666114","https://openalex.org/W2278579274"],"abstract_inverted_index":{"The":[0],"notion":[1],"of":[2,13,19,52],"robust":[3,70],"expansion":[4],"has":[5],"played":[6],"a":[7,47,74],"central":[8],"role":[9],"in":[10,22],"the":[11,17,34,80],"solution":[12],"several":[14],"conjectures":[15],"involving":[16],"packing":[18],"Hamilton":[20,48],"cycles":[21],"graphs":[23],"and":[24,28,58],"directed":[25],"graphs.":[26],"These":[27],"other":[29],"results":[30],"usually":[31],"rely":[32],"on":[33],"fact":[35,61],"that":[36,76],"every":[37],"robustly":[38,92],"expanding":[39,93],"(di)graph":[40],"with":[41],"suitably":[42],"large":[43,69],"minimum":[44],"degree":[45],"contains":[46],"cycle.":[49],"Previous":[50],"proofs":[51],"this":[53,60],"require":[54],"Szemer\u00e9di's":[55],"Regularity":[56,81],"Lemma":[57,82],"so":[59],"can":[62,86],"only":[63],"be":[64],"applied":[65],"to":[66,90],"dense,":[67],"sufficiently":[68],"expanders.":[71],"We":[72],"give":[73],"proof":[75],"does":[77],"not":[78],"use":[79],"and,":[83],"indeed,":[84],"we":[85],"apply":[87],"our":[88],"result":[89],"sparser":[91],"digraphs.":[94]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}