Ruth Luo

activity

20242026

collaborators

7 papers

math.CO2026

Spectral radius and Hamiltonicity of uniform hypergraphs

George Brooks, William Linz, Ruth Luo

Let $n$ and $r$ be integers with $n - 2 \geq r \geq 3$ . We prove that any $r$ -uniform hypergraph $H$ on $n$ vertices with spectral radius $I^» (H) > (r - 1 n - 2)$ m…

math.CO2026

Covering complete $r$ -partite hypergraphs with few monochromatic components

Luke Hawranick, Ruth Luo

An edge-coloring of a hypergraph is {\em spanning} if every vertex sees every color used in the coloring. In this paper, we prove that for $k \geq 2 r \geq 6$ , in any spanning $k$ -c…

math.CO2025

Ore's Theorem for rainbow Hamiltonian-connected graphs

Yupei Li, Ruth Luo

Let $G = (G_{1}, G_{2}, \dots, G_{m})$ be a collection of $m$ graphs on a common vertex set $V$ . For a graph $H$ with vertices in $V$ , we say that $G$ contains a rainbow $H$ if there is…

math.CO2025

An Ore-type theorem for $[3]$ -graphs

Yupei Li, Linyuan Lu, Ruth Luo

Ore's Theorem states that if $G$ is an $n$ -vertex graph and every pair of non-adjacent vertices has degree sum at least $n$ , then $G$ is Hamiltonian. A $[3]$ -graph is a hypergraph…

math.CO2025

Pancyclicity in hypergraphs with large uniformity

Teegan Bailey, Isaiah Hollars, Yupei Li +1

A Berge cycle of length $ℓ$ in a hypergraph $H$ is a sequence of alternating vertices and edges $v_{0} e_{0} v_{1} e_{1} ... v_{ℓ} e_{ℓ} v_{0}$ such that $\{v_i,v_{i+1}\}\subseteq…

math.CO2024

Berge Pancyclic hypergraphs

Teegan Bailey, Yupei Li, Ruth Luo

A Berge cycle of length $ℓ$ in a hypergraph is an alternating sequence of $ℓ$ distinct vertices and $ℓ$ distinct edges $v_{1}, e_{1}, v_{2}, \dots, v_{ℓ}, e_{ℓ}$ such that $\…

Spectral radius and Hamiltonicity of uniform hypergraphs

Covering complete r-partite hypergraphs with few monochromatic components

Ore's Theorem for rainbow Hamiltonian-connected graphs

An Ore-type theorem for [3]-graphs

Pancyclicity in hypergraphs with large uniformity

Berge Pancyclic hypergraphs

Covering complete $r$ -partite hypergraphs with few monochromatic components

An Ore-type theorem for $[3]$ -graphs