Yi Zhao
Discrete Mathematics and Combinatorics · 2015
A researcher in the Science corpus: 1 paper; trusts 11 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Discrete Mathematics and Combinatorics — 9 citations into it
- Computational Theory and Mathematics — 7 citations into it
- Geometry and Topology — 7 citations into it
Whom Yi Zhao trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Vojtech Rödl
- Andrzej Rucinski
- Peter Keevash
- Richard M. Karp
- Jie Han
- Endre Szemerédi
- Allan Siu Lun Lo
- D. Kühn
- Joel Friedman
Who trusts Yi Zhao overall
Papers from Yi Zhao's perspective
Ordered by how strongly the researchers Yi Zhao trusts endorse each paper. Same corpus, a different order for every researcher.
- A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
- The existence of designs
- Reducibility Among Combinatorial Problems
- Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs
- $F$-factors in hypergraphs via absorption
- Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs
- Paths, Trees, and Flowers
- A Geometric Theory for Hypergraph Matching
- Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
- Combinatorial theorems in sparse random sets
Their papers
- Recent advances on Dirac-type problems for hypergraphs (2015) — 122 citations