Papers
Topics
Authors
Recent
Search
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 CC be a Hamiltonian Berge cycle on n=2r+1n=2r+1 vertices, and let G\mathcal G be a set of hyperedges, all of size at least rr, containing the hyperedges of CC. If D⊆{2,…,r}D\subseteq\{2,\ldots,r\} and ∣G∣≥n+∣D∣|\mathcal G|\ge n+|D|, then the hyperedges can be reassigned to the adjacent pairs of the same cyclic order so that, for each d∈Dd\in D, a distinct unused hyperedge realizes cyclic distance dd. Consequently, the odd-order case of the one-extra-edge question of Bailey, Hollars, Li and Luo has an affirmative answer for all n=2r+1≥7n=2r+1\ge7, in the convention including Berge cycles of length $2$. The proof combines an additive lemma in Z2r+1\mathbb Z_{2r+1} with an alternating matching exchange.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.