The following pages link to Yi Zhao (Q409468):
Displayed 44 items.
- Hamiltonian cycles with all small even chords (Q409469) (← links)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs (Q439060) (← links)
- (Q516074) (redirect page) (← links)
- Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075) (← links)
- Forbidding Hamilton cycles in uniform hypergraphs (Q530769) (← links)
- Proof of the \((n/2 - n/2 - n/2)\) conjecture for large \(n\) (Q625393) (← links)
- Hamiltonicity in randomly perturbed hypergraphs (Q777475) (← links)
- The DNF exception problem (Q818117) (← links)
- On the VC-dimension of uniform hypergraphs (Q857750) (← links)
- A note on perfect matchings in uniform hypergraphs (Q907268) (← links)
- On a two-sided Turán problem (Q1422128) (← links)
- On a tiling conjecture of Komlós for 3-chromatic graphs. (Q1426117) (← links)
- A degree version of the Hilton-Milner theorem (Q1689057) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- On multipartite Hajnal-Szemerédi theorems (Q1945958) (← links)
- Improved bounds on the Ramsey number of fans (Q2033888) (← links)
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs (Q2072182) (← links)
- Turán number of disjoint triangles in 4-partite graphs (Q2144320) (← links)
- Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs (Q2258905) (← links)
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II (Q2349181) (← links)
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs (Q2349508) (← links)
- Tiling tripartite graphs with 3-colorable graphs (Q2380267) (← links)
- Codegree problems for projective geometries (Q2384802) (← links)
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture (Q2397107) (← links)
- New upper bound for sums of dilates (Q2401423) (← links)
- Forbidding complete hypergraphs as traces (Q2478165) (← links)
- Non-uniform Turán-type problems (Q2484510) (← links)
- Co-degree density of hypergraphs (Q2642025) (← links)
- Codegree Thresholds for Covering 3-Uniform Hypergraphs (Q2826217) (← links)
- Minimum degree thresholds for bipartite graph tiling (Q2888882) (← links)
- Recent advances on Dirac-type problems for hypergraphs (Q2957178) (← links)
- Existence thresholds and Ramsey properties of random posets (Q3386529) (← links)
- Bipartite Graph Tiling (Q3563949) (← links)
- An Exact Result for Hypergraphs and Upper Bounds for the Turán Density of $K^r_{r+1}$ (Q3583305) (← links)
- Proof of a tiling conjecture of Komlós (Q4434471) (← links)
- Codegree Turán Density of Complete $r$-Uniform Hypergraphs (Q4563373) (← links)
- Turán Densities of Some Hypergraphs Related to $K_{k+1}^{k}$ (Q4915190) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- Matchings in <i>k</i>‐partite <i>k</i>‐uniform hypergraphs (Q5066909) (← links)
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
- Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) (← links)
- Exact Minimum Codegree Threshold for <i>K</i><sup>−</sup><sub>4</sub>-Factors (Q5373833) (← links)
- Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs (Q5419939) (← links)
- Complete subgraphs in a multipartite graph (Q5886355) (← links)