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

28 papers

math.CO2022

On subgraphs of tripartite graphs

Abhijeet Bhalkikar, Yi Zhao

Bollobás, Erdős, and Szemerédi [Discrete Math 13 (1975), 97--107] investigated a tripartite generalization of the Zarankiewicz problem: what minimum degree forces a tripartite grap…

math.CO2022

Independence number of hypergraphs under degree conditions

Vojtěch Rödl, Marcelo Sales, Yi Zhao

A well-known result of Ajtai et al. from 1982 states that every $k$ -graph $H$ on $n$ vertices, with girth at least five, and average degree $t^{k - 1}$ contains an independent set of…

math.CO2021★ 3 cited

Complete subgraphs in a multipartite graph

Allan Lo, Andrew Treglown, Yi Zhao

In 1975 Bollobás, Erd\H os, and Szemerédi asked the following question: given positive integers $n, t, r$ with $2 \leq t \leq r - 1$ , what is the largest minimum degree $δ (G)$ among all…

math.CO2021

Shadows of 3-uniform hypergraphs under a minimum degree condition

Zoltán Füredi, Yi Zhao

We prove a minimum degree version of the Kruskal--Katona theorem: given $d \geq 1/4$ and a triple system $F$ on $n$ vertices with minimum degree at least $d (2 n)$ , we obtain asym…

math.CO2020★ 6 cited

Improved bounds on the Ramsey number of fans

Guantao Chen, Xiaowei Yu, Yi Zhao

For a given graph $H$ , the Ramsey number $r (H)$ is the minimum $N$ such that any 2-edge-coloring of the complete graph $K_{N}$ yields a monochromatic copy of $H$ . Given a positive in…

math.CO2020

Minimum degree thresholds for Hamilton $(k /2)$ -cycles in $k$ -uniform hypergraphs

Hiep Han, Jie Han, Yi Zhao

For any even integer $k \geq 6$ , integer $d$ such that $k /2 \leq d \leq k - 1$ , and sufficiently large $n \in (k /2) N$ , we find a tight minimum $d$ -degree condition that guarantees t…