{"id":"https://openalex.org/W3093185772","doi":"https://doi.org/10.1017/s0963548320000486","title":"Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs","display_name":"Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs","publication_year":2020,"publication_date":"2020-10-12","ids":{"openalex":"https://openalex.org/W3093185772","doi":"https://doi.org/10.1017/s0963548320000486","mag":"3093185772"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548320000486","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000486","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB476B5F977F5C6EC9F947498CD2D1FB/S0963548320000486a.pdf/div-class-title-tight-hamilton-cycles-in-cherry-quasirandom-3-uniform-hypergraphs-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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB476B5F977F5C6EC9F947498CD2D1FB/S0963548320000486a.pdf/div-class-title-tight-hamilton-cycles-in-cherry-quasirandom-3-uniform-hypergraphs-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029280195","display_name":"Elad Aigner\u2010Horev","orcid":"https://orcid.org/0000-0002-9207-0596"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Elad Aigner-Horev","raw_affiliation_strings":["Department of Mathematics and Computer Science, Ariel University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Ariel University, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004023886","display_name":"Gil Levy","orcid":null},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Gil Levy","raw_affiliation_strings":["Department of Mathematics and Computer Science, Ariel University, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Ariel University, Israel","institution_ids":["https://openalex.org/I52170813"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029280195"],"corresponding_institution_ids":["https://openalex.org/I52170813"],"apc_list":null,"apc_paid":null,"fwci":3.2818,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.92580049,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"3","first_page":"412","last_page":"443"},"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.9994999766349792,"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/T10849","display_name":"Finite Group Theory Research","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7979713082313538},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.718600332736969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7129384279251099},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5004410743713379},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44285085797309875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41960710287094116},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41502851247787476},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3938263952732086},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15812724828720093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10087928175926208}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7979713082313538},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.718600332736969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7129384279251099},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5004410743713379},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44285085797309875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41960710287094116},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41502851247787476},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3938263952732086},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15812724828720093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10087928175926208},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548320000486","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000486","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB476B5F977F5C6EC9F947498CD2D1FB/S0963548320000486a.pdf/div-class-title-tight-hamilton-cycles-in-cherry-quasirandom-3-uniform-hypergraphs-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"}],"best_oa_location":{"id":"doi:10.1017/s0963548320000486","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548320000486","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/DB476B5F977F5C6EC9F947498CD2D1FB/S0963548320000486a.pdf/div-class-title-tight-hamilton-cycles-in-cherry-quasirandom-3-uniform-hypergraphs-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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3093185772.pdf","grobid_xml":"https://content.openalex.org/works/W3093185772.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W1518401101","https://openalex.org/W1634451192","https://openalex.org/W1639593279","https://openalex.org/W1923478559","https://openalex.org/W1969731303","https://openalex.org/W1970254348","https://openalex.org/W1971367602","https://openalex.org/W1993865305","https://openalex.org/W1999115197","https://openalex.org/W2001766673","https://openalex.org/W2008309723","https://openalex.org/W2034978892","https://openalex.org/W2036523948","https://openalex.org/W2044905288","https://openalex.org/W2053158631","https://openalex.org/W2076302993","https://openalex.org/W2082894877","https://openalex.org/W2099989374","https://openalex.org/W2108540837","https://openalex.org/W2116537669","https://openalex.org/W2134184632","https://openalex.org/W2144292514","https://openalex.org/W2150302760","https://openalex.org/W2201645533","https://openalex.org/W2252370674","https://openalex.org/W2264868302","https://openalex.org/W2299881678","https://openalex.org/W2345399213","https://openalex.org/W2419111809","https://openalex.org/W2478722229","https://openalex.org/W2614047805","https://openalex.org/W2745292603","https://openalex.org/W2901284226","https://openalex.org/W2951625213","https://openalex.org/W2963944538","https://openalex.org/W2964098318","https://openalex.org/W2964115409","https://openalex.org/W2984228414","https://openalex.org/W3099084195","https://openalex.org/W3099266942","https://openalex.org/W3100427284","https://openalex.org/W3101931093","https://openalex.org/W3104344645","https://openalex.org/W3106426318","https://openalex.org/W3144881883","https://openalex.org/W4244050075","https://openalex.org/W6659544648"],"related_works":["https://openalex.org/W3161230432","https://openalex.org/W1487201914","https://openalex.org/W4367190712","https://openalex.org/W280458463","https://openalex.org/W1170131723","https://openalex.org/W4301429470","https://openalex.org/W2168900540","https://openalex.org/W2125310826","https://openalex.org/W2339723535","https://openalex.org/W2014652112"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"employ":[2],"the":[3,13,20,65],"absorbing-path":[4],"method":[5],"in":[6,19],"order":[7,44],"to":[8,72],"prove":[9,81],"two":[10],"results":[11],"regarding":[12],"emergence":[14],"of":[15,41,104],"tight":[16,58,75,124],"Hamilton":[17,59,76,125],"cycles":[18],"so-called":[21],"two-path":[22],"or":[23],"cherry":[24],"-quasirandom":[25],"3-graphs.":[26],"Our":[27,61],"first":[28],"result":[29,63],"asserts":[30],"that":[31,82],"for":[32,69,83],"any":[33,96],"fixed":[34],"real":[35],"\u03b1":[36,51,87,93],">":[37,88,94],"0,":[38],"cherry-quasirandom":[39],"3-graphs":[40,71],"sufficiently":[42,97],"large":[43,98],"n":[45,53,99],"having":[46],"minimum":[47,66,108],"2-degree":[48],"at":[49,110],"least":[50,111],"(":[52],"\u2013":[54],"2)":[55],"have":[56,73],"a":[57,74,123],"cycle.":[60,77,126],"second":[62],"concerns":[64],"1-degree":[67,109],"sufficient":[68],"such":[70,101],"Roughly":[78],"speaking,":[79],"we":[80],"every":[84],"d":[85,91,106],",":[86],"0":[89],"satisfying":[90],"+":[92],"1,":[95],"-vertex":[100],"3-graph":[102],"H":[103],"density":[105],"and":[107],"$\\alpha":[112],"\\left({\\matrix{{n":[113],"-":[114],"1}":[115],"\\cr":[116,118],"2":[117],"}":[119,120],"\\right)$":[121],"has":[122]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}