Yi Zhao

activity

20082022

most citedMinimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs

36 citations · 131 across the 28 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015

Codegree thresholds for covering 3-uniform hypergraphs

Victor Falgas-Ravry, Yi Zhao

Given two 3-uniform hypergraphs F and G, we say that G has an F-covering if we can cover V(G) by copies of F. The minimum codegree of G is the largest integer d such that every pai…

math.CO2015★ 5 cited

Recent advances on Dirac-type problems for hypergraphs

Yi Zhao

A fundamental question in graph theory is to establish conditions that ensure a graph contains certain spanning subgraphs. Two well-known examples are Tutte's theorem on perfect ma…

math.CO2015★ 1 cited

Forbidding Hamilton cycles in uniform hypergraphs

Jie Han, Yi Zhao

For $1 \leq d \leq ℓ < k$ , we give a new lower bound for the minimum $d$ -degree threshold that guarantees a Hamilton $ℓ$ -cycle in $k$ -uniform hypergraphs. When $k \geq 4$ and $d< \e…

math.CO2015★ 31 cited

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs

Jie Han, Chuanyun Zang, Yi Zhao

Given positive integers $a \leq b \leq c$ , let $K_{a, b, c}$ be the complete 3-partite 3-uniform hypergraph with three parts of sizes $a, b, c$ . Let $H$ be a 3-uniform hypergraph on $n$ …