Linyuan Lu

collaborators

3 papers

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.CO2024

On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature

Xiaonan Liu, Linyuan Lu, Zhiyu Wang

In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph $G$ with minimum degree at least $2$ has positive Lin-Lu-Yau curvature o…

math.CO2019

On Hamiltonian Berge cycles in $3$ -uniform hypergraphs

Linyuan Lu, Zhiyu Wang

Given a set $R$ , a hypergraph is $R$ -uniform if the size of every hyperedge belongs to $R$ . A hypergraph $H$ is called \textit{covering} if every vertex pair is contained…

An Ore-type theorem for [3]-graphs

On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature

On Hamiltonian Berge cycles in 3-uniform hypergraphs

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

On Hamiltonian Berge cycles in $3$ -uniform hypergraphs