Yi Zhao

activity

20142025

collaborators

5 papers

math.CO2025

Partial independent transversals in multipartite graphs

Penny Haxell, Arpit Mittal, Yi Zhao

Given integers $r > d \geq 0$ and an $r$ -partite graph, an independent $(r - d)$ -transversal or $(r - d)$ -IT is an independent set of size $r - d$ that intersects each part in at most one ve…

math.CO2024

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree

Yihan Chen, Jialin He, Allan Lo +3

In 1975 Bollobás, Erdős, and Szemerédi asked what minimum degree guarantees an octahedral subgraph $K_{3} (2)$ in any tripartite graph $G$ with $n$ vertices in each vertex class. We s…

math.CO2024

Turán number of complete multipartite graphs in multipartite graphs

Jie Han, Yi Zhao

In this paper we study a multi-partite version of the Erdős--Stone theorem. Given integers $r < k$ and $t \geq 1$ , let $ex_{k} (n, K_{r + 1} (t))$ be the maximum number of edges of $K…

math.CO2018

Codegree Turán density of complete $r$ -uniform hypergraphs

Allan Lo, Yi Zhao

Let $r \geq 3$ . Given an $r$ -graph $H$ , the minimum codegree $δ_{r - 1} (H)$ is the largest integer $t$ such that every $(r - 1)$ -subset of $V (H)$ is contained in at least $t$ edges of $H…

math.CO2014

Minimum codegree threshold for Hamilton l-cycles in k-uniform hypergraphs