2000 character limit reached
Prescribed leftover chords and one-extra-edge Berge pancyclicity
Published 10 Jun 2026 in math.CO | (2606.12230v1)
Abstract: We prove a prescribed-leftover-chord theorem for Hamiltonian Berge cycles of odd order. Let be a Hamiltonian Berge cycle on vertices, and let be a set of hyperedges, all of size at least , containing the hyperedges of . If and , then the hyperedges can be reassigned to the adjacent pairs of the same cyclic order so that, for each , a distinct unused hyperedge realizes cyclic distance . Consequently, the odd-order case of the one-extra-edge question of Bailey, Hollars, Li and Luo has an affirmative answer for all , in the convention including Berge cycles of length $2$. The proof combines an additive lemma in with an alternating matching exchange.
Paper Prompts
Sign up for free to create and run prompts on this paper.