2 citations · 2 across the 5 of their papers we have counts for
5 papers · 2 filters
Codegree conditions for tiling complete -partite -graphs and loose cycles
Wei Gao, Jie Han, Yi Zhao
Given two -graphs (-uniform hypergraphs) and , a perfect -tiling (or an -factor) in is a set of vertex disjoint copies of that together cover the vertex…
Matchings in -partite -uniform Hypergraphs
Jie Han, Chuanyun Zang, Yi Zhao
For and , let be a -partite -graph with parts each of size , where is sufficiently large. Assume that for each , every $(k…
New Upper Bound for Sums of Dilates
Albert Bush, Yi Zhao
For , let . Suppose are sufficiently large and comparable to each other. We prove that if and…
Degree versions of the Erdos-Ko-Rado Theorem and Erdos hypergraph matching conjecture
Hao Huang, Yi Zhao
We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given , every intersecting -uniform hypergraph on vertices contain…
Asymptotics of Ramsey numbers of double stars
Sergey Norin, Yue Ru Sun, Yi Zhao
A double star is the graph obtained by joining the center of a star with leaves to a center of a star with leaves by an edge. Let denote the Ramsey num…