Work

Spectral radius and Hamiltonicity of uniform hypergraphs

Year: 2026

Type: article

Abstract: Let n and r be integers with n − 2 ≥ r ≥ 3 . We prove that any r -uniform hypergraph H on n vertices with spectral radius λ ( H ) > ( n − 2 r − 1 ) must contain a Hamiltonian Berge cycle unless H is the complete graph K n − 1 r with one additional edge. This generalizes a result proved by Fiedler and Nikiforov for graphs. As part of our proof, we show that if | H | > ( n − 1 r ) , then H contains a Hamiltonian Berge cycle unless H is the complete graph K n − 1 r with one additional edge, generalizing a classical theorem for graphs.

Source: Discrete Mathematics

DOI: 10.1016/j.disc.2026.115184

Authors: George Brooks, William Linz, Ruth Luo

Institution: University of South Carolina

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,320

Funder: National Science Foundation