{"paper":{"title":"Berge Pancyclic hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruth Luo, Teegan Bailey, Yupei Li","submitted_at":"2024-10-29T04:40:15Z","abstract_excerpt":"A Berge cycle of length $\\ell$ in a hypergraph is an alternating sequence of $\\ell$ distinct vertices and $\\ell$ distinct edges $v_1,e_1,v_2, \\ldots, v_\\ell, e_{\\ell}$ such that $\\{v_i, v_{i+1}\\} \\subseteq e_i$ for all $i$, with indices taken modulo $\\ell$. We call an $n$-vertex hypergraph pancyclic if it contains Berge cycles of every length from $3$ to $n$. We prove a sharp Dirac-type result guaranteeing pancyclicity in uniform hypergraphs: for $n \\geq 70$, $3 \\leq r \\leq \\lfloor (n-1)/2\\rfloor - 2$, if $\\cH$ is an $n$-vertex, $r$-uniform hypergraph with minimum degree at least ${\\lfloor (n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.21733","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.21733/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}