6 papers
Turán-Type Bounds for Graphs Containing Large -Sparse Sets
Yupei Li, Linyuan Lu
We study Turán-type extremal problems for graphs containing a large -sparse vertex set, meaning a vertex set whose induced subgraph contains few copies of . For integers $r>…
Ore's Theorem for rainbow Hamiltonian-connected graphs
Yupei Li, Ruth Luo
Let be a collection of graphs on a common vertex set . For a graph with vertices in , we say that contains a rainbow if there is…
An Ore-type theorem for -graphs
Yupei Li, Linyuan Lu, Ruth Luo
Ore's Theorem states that if is an -vertex graph and every pair of non-adjacent vertices has degree sum at least , then is Hamiltonian. A -graph is a hypergraph…
Pancyclicity in hypergraphs with large uniformity
Teegan Bailey, Isaiah Hollars, Yupei Li +1
A Berge cycle of length in a hypergraph is a sequence of alternating vertices and edges such that $\{v_i,v_{i+1}\}\subseteq…
Ricci Curvature Formula: Applications to Bonnet-Myers Sharp Irregular Graphs
Yupei Li, Linyuan Lu
In this paper, we establish a simple formula for computing the Lin-Lu-Yau Ricci curvature on graphs. For any edge in a simple locally finite graph , the curvature …
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 such that $\…