Papers
Topics
Authors
Recent
Search
2000 character limit reached

Berge Hamilton Cycle in Hypergraphs

Updated 10 July 2026
  • Berge Hamilton cycle is defined as an alternating sequence of distinct vertices and hyperedges spanning all vertices in a hypergraph.
  • Degree conditions and connectivity criteria, including Pósa-style sequences and minimum-degree thresholds, ensure the cycle’s existence in both deterministic and random settings.
  • Proof methods leverage incidence bipartite graphs, shadow graphs, and absorbing techniques, leading to advances in decomposition, pancyclicity, and Ramsey-type results.

A Berge Hamilton cycle is a Hamiltonian Berge cycle in a hypergraph: an alternating sequence of distinct vertices and distinct hyperedges

(v1,e1,v2,e2,…,vn,en)(v_1,e_1,v_2,e_2,\dots,v_n,e_n)

such that each eie_i contains viv_i and vi+1v_{i+1} with indices taken cyclically, and the vertex sequence uses every vertex of the hypergraph. In the modern literature this is the earliest and most classical hypergraph analogue of a graph cycle, and it remains central because it is flexible enough to interact with extremal, probabilistic, decomposition, and Ramsey-theoretic methods while still retaining a genuinely spanning notion of Hamiltonicity (Kühn et al., 2014, 1903.09057).

1. Definition, formalizations, and relation to other cycle notions

The Berge notion admits several equivalent formalisms. In the general Berge-GG framework, a hypergraph H\mathcal H is a Berge-GG if there is a bijection f:E(G)→E(H)f:E(G)\to E(\mathcal H) such that e⊂f(e)e\subset f(e) for every graph edge e∈E(G)e\in E(G). Specializing to eie_i0 yields a Berge cycle of length eie_i1; when that cycle spans the full vertex set, one obtains a Berge Hamilton cycle (Gerbner et al., 2015).

A recurring distinction is between ordinary Berge cycles and weak Berge cycles. In a weak Hamiltonian Berge cycle the hyperedges in the alternating sequence are not required to be distinct, whereas in a Berge Hamilton cycle they are. This distinction is immaterial in ordinary graphs but structurally significant in hypergraphs, particularly in threshold and stopping-time results (Bal et al., 2018).

Berge Hamilton cycles should also be separated from eie_i2-cycles. Every eie_i3-cycle is a Berge cycle, and every tight Hamilton cycle is a Hamilton Berge cycle. By contrast, for eie_i4, a Hamilton eie_i5-cycle is not a Hamilton Berge cycle in general because it has too few hyperedges (1903.09057).

An important representation is via the incidence bipartite graph. Berge cycles correspond exactly to cycles in that incidence graph, and Hamiltonian Berge cycles correspond to cycles covering all vertex-vertices on the hypergraph side. This translation is especially useful in connectivity and longest-cycle arguments, where bipartite graph techniques can be applied directly to hypergraphs (Salia, 2021, Kostochka et al., 2020).

2. Degree conditions, exact-type criteria, and structural forcing

A large part of the theory asks which local density conditions force a Berge Hamilton cycle. One sharp-type direction is Pósa-style degree-sequence forcing. For eie_i6-uniform hypergraphs with degree sequence eie_i7, eie_i8, and eie_i9, the degree conditions

viv_i0

and

viv_i1

together with an additional even-viv_i2 correction, are sufficient for Berge Hamiltonicity, and the paper gives explicit extremal constructions showing the conditions are sharp. The same work also proves a non-uniform analogue with thresholds viv_i3 up to the middle of the degree sequence, again with an even-viv_i4 correction (Salia, 2021).

A different exact-type criterion uses connectivity together with minimum degree. Every viv_i5-connected hypergraph viv_i6 with

viv_i7

has a hamiltonian Berge cycle. This result is sharp and is obtained by translating the problem to viv_i8-connected bipartite incidence graphs that contain a cycle through all vertices on one side (Kostochka et al., 2020).

Sparse random analogues of Dirac-type forcing are also available. For the binomial random viv_i9-uniform hypergraph vi+1v_{i+1}0, asymptotically almost surely every spanning subgraph vi+1v_{i+1}1 with

vi+1v_{i+1}2

contains a Hamilton Berge cycle, provided

vi+1v_{i+1}3

The minimum-degree constant is asymptotically tight, with the standard obstruction given by splitting the vertex set into two nearly equal parts and retaining only induced edges inside the parts (1903.09057).

These criteria collectively show that Berge Hamiltonicity is governed by several distinct thresholds: exact degree-sequence conditions in deterministic uniform and non-uniform settings, connectivity-sensitive incidence-graph thresholds, and resilience-type minimum-degree conditions in sparse random environments. This suggests that the Berge notion is flexible enough to absorb techniques from both graph Hamiltonicity and hypergraph expansion, but rigid enough to sustain sharp extremal barriers (Salia, 2021, 1903.09057).

3. Pancyclicity, covering conditions, and local surplus phenomena

In some regimes the natural conclusion is stronger than Hamiltonicity. For vi+1v_{i+1}4-uniform covering hypergraphs, where every vertex pair lies in some hyperedge, every covering vi+1v_{i+1}5-graph on vi+1v_{i+1}6 vertices contains a Berge cycle vi+1v_{i+1}7 for every vi+1v_{i+1}8. In particular, every such hypergraph contains a Hamiltonian Berge cycle. The proof proceeds through a Hamiltonian Berge path and then a structural analysis of an vi+1v_{i+1}9-cycle with one external vertex (Lu et al., 2019).

A sharp Dirac-type pancyclicity theorem is known for larger uniformity. If GG0, GG1, and an GG2-vertex GG3-uniform hypergraph GG4 satisfies

GG5

then GG6 is pancyclic, meaning that it contains Berge cycles of every length from GG7 to GG8. The Hamiltonian Berge cycle is then simply the length-GG9 case. The threshold is sharp: the paper gives constructions with minimum degree exactly H\mathcal H0 but no Berge Hamilton cycle (Bailey et al., 2024).

Odd-order Hamiltonian Berge cycles exhibit an additional local robustness phenomenon. Let H\mathcal H1, let H\mathcal H2 be a Hamiltonian Berge cycle, and let H\mathcal H3 be a family of hyperedges, all of size at least H\mathcal H4, containing the hyperedges of H\mathcal H5. If H\mathcal H6 and H\mathcal H7, then the hyperedges can be reassigned to the adjacent pairs of the same cyclic order so that, for each H\mathcal H8, a distinct unused hyperedge realizes cyclic distance H\mathcal H9. Consequently, the odd-order case of the one-extra-edge question of Bailey, Hollars, Li and Luo has an affirmative answer for all GG0, in the convention including Berge cycles of length GG1 (Shin, 10 Jun 2026).

These results clarify a common misconception. A Berge Hamilton cycle is not merely a terminal longest-cycle statement; in several dense or covering regimes it lies inside a substantially richer cycle structure, sometimes full pancyclicity and sometimes a reassignable Hamiltonian framework with prescribed leftover chords (Lu et al., 2019, Shin, 10 Jun 2026).

4. Random hypergraphs and hitting-time theory

The random theory of Berge Hamilton cycles is notably sharp. In the random GG2-uniform hypergraph process GG3, where edges are added sequentially, the stopping-time theorem states that for fixed GG4,

GG5

almost surely has a weak Hamiltonian Berge cycle, while

GG6

almost surely has a Hamiltonian Berge cycle, where GG7 is the first time the minimum degree reaches GG8. Thus the natural obstruction for full Berge Hamiltonicity is exactly minimum degree GG9 (Bal et al., 2018).

The same paper identifies the threshold in the Erdős–Rényi model f:E(G)→E(H)f:E(G)\to E(\mathcal H)0. If

f:E(G)→E(H)f:E(G)\to E(\mathcal H)1

then the probability of Berge Hamiltonicity has the limiting behavior

f:E(G)→E(H)f:E(G)\to E(\mathcal H)2

according as f:E(G)→E(H)f:E(G)\to E(\mathcal H)3, f:E(G)→E(H)f:E(G)\to E(\mathcal H)4, or f:E(G)→E(H)f:E(G)\to E(\mathcal H)5. The f:E(G)→E(H)f:E(G)\to E(\mathcal H)6-out model is also sufficient for ordinary Berge Hamiltonicity when f:E(G)→E(H)f:E(G)\to E(\mathcal H)7, whereas the f:E(G)→E(H)f:E(G)\to E(\mathcal H)8-out model is not (Bal et al., 2018).

A dense-host extension of the hitting-time paradigm is now available. In a random process constrained to a dense f:E(G)→E(H)f:E(G)\to E(\mathcal H)9-uniform host hypergraph e⊂f(e)e\subset f(e)0, the hitting time e⊂f(e)e\subset f(e)1 for minimum degree e⊂f(e)e\subset f(e)2 coincides with the hitting time e⊂f(e)e\subset f(e)3 for the first Berge Hamilton cycle with high probability, provided the host satisfies either

e⊂f(e)e\subset f(e)4

or

e⊂f(e)e\subset f(e)5

and, more generally, a local codegree-overlap condition. This extends the complete-host result of Bal, Berkowitz, Devlin, and Schacht to dense host hypergraphs (Im et al., 7 Dec 2025).

Random results also reveal the boundary between graph Hamiltonicity and Berge Hamiltonicity. The weak cycle threshold is tied to disappearance of isolated vertices, whereas ordinary Berge Hamiltonicity requires the distinct-edge constraint and therefore the stronger minimum-degree-e⊂f(e)e\subset f(e)6 barrier. This sharp separation has no direct graph analogue because in graphs repeated-edge and distinct-edge formulations coincide (Bal et al., 2018).

5. Decompositions and Ramsey-type forcing

A classical global question asks when all edges of a large hypergraph can be partitioned into Hamilton Berge cycles. For the complete e⊂f(e)e\subset f(e)7-uniform hypergraph e⊂f(e)e\subset f(e)8, the obvious necessary condition is

e⊂f(e)e\subset f(e)9

since each Hamilton Berge cycle uses exactly e∈E(G)e\in E(G)0 hyperedges. Kühn and Osthus proved that this condition is sufficient whenever e∈E(G)e\in E(G)1, e∈E(G)e\in E(G)2, and the divisibility condition holds. Their argument converts the decomposition problem into a perfect-matching problem in an auxiliary bipartite graph and uses the Kruskal–Katona theorem together with Tillson’s theorem on Hamilton decompositions of complete digraphs (Kühn et al., 2014).

Ramsey-type forcing concerns monochromatic Berge Hamilton cycles in edge-colored complete uniform hypergraphs. One theorem shows that if e∈E(G)e\in E(G)3 and

e∈E(G)e\in E(G)4

then every

e∈E(G)e\in E(G)5

contains a monochromatic Hamiltonian e∈E(G)e\in E(G)6-tight Berge-cycle. For e∈E(G)e\in E(G)7, this yields that every e∈E(G)e\in E(G)8-edge coloring of e∈E(G)e\in E(G)9 with eie_i00 contains a monochromatic Hamiltonian Berge-cycle; the same paper also proves that any eie_i01-edge coloring of eie_i02 with eie_i03 contains such a cycle (Omidi et al., 2014).

The original conjecture of Gyárfás, Lehel, Sárközy, and Schelp asked for eie_i04-colorings rather than eie_i05-colorings. This was proved for sufficiently large eie_i06: if eie_i07 and

eie_i08

then every eie_i09-edge-coloring of eie_i10 contains a monochromatic Hamiltonian Berge-cycle. The proof uses the shadow graph, a notion of good colors on graph edges, and a Hamiltonicity argument in an auxiliary graph satisfying Chvátal-type degree conditions (Omidi, 2014).

These decomposition and Ramsey results position Berge Hamilton cycles as a canonical spanning object in complete uniform hypergraphs. In decomposition problems they play the role of Walecki-type factors; in coloring problems they play the role of unavoidable monochromatic spanning structures (Kühn et al., 2014, Omidi, 2014).

6. Proof methods, representations, and scope

Several proof paradigms recur across the subject. Shadow graphs are fundamental: if a graph edge in the eie_i11-shadow can be matched to a distinct containing hyperedge, then graph cycles lift to Berge cycles. This idea drives both pancyclicity proofs and monochromatic forcing arguments (Bailey et al., 2024, Omidi et al., 2014).

The incidence-graph viewpoint is equally central. By encoding vertices and hyperedges as the two parts of a bipartite graph, Berge Hamiltonicity becomes a long-cycle problem in bipartite graphs. This is the natural language for eie_i12-connectedness results and for translating hypergraph questions into graph Hamiltonicity techniques involving fans, longest cycles, and structural obstructions (Kostochka et al., 2020, Salia, 2021).

Absorbing methods, expander methods, and rotation-extension ideas also transfer effectively. The random-hypergraph Dirac theorem uses an absorbing-reservoir decomposition with vertex sets eie_i13, eie_i14, and eie_i15, together with pseudorandomness, matching lemmas, and connection lemmas for edge-disjoint Berge paths (1903.09057). The random-process results use sparse expanders, Pósa rotation for Berge paths, and booster or booster-pair arguments to iteratively force Hamiltonicity (Bal et al., 2018, Im et al., 7 Dec 2025).

At the combinatorial end, Hall-type matching and exchange arguments remain ubiquitous. They appear in decomposition theorems through auxiliary bipartite graphs (Kühn et al., 2014), in colored settings through shadow-graph lifting (Omidi et al., 2014), and in odd-order leftover-chord theorems through alternating matching exchange combined with an additive lemma in eie_i16 (Shin, 10 Jun 2026).

The scope of the concept is broad but not unlimited. A Berge Hamilton cycle is a spanning hypergraph cycle notion, but it is weaker than tight Hamiltonicity, stronger than weak Berge Hamiltonicity, and conceptually different from ordinary graph Hamilton cycles. Results about graph Hamiltonicity, Grinberg conditions, or cycle spaces may provide analogies, yet they do not automatically transfer to the Berge setting. The modern literature therefore treats Berge Hamiltonicity as a distinct branch of hypergraph Hamilton cycle theory, with its own thresholds, extremal constructions, random hitting times, and Ramsey phenomena (1903.09057, Bal et al., 2018).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

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

Follow Topic

Get notified by email when new papers are published related to Berge Hamilton Cycle.