Jie Han

Discrete Mathematics and Combinatorics · with Kohayakawa · 2014–2015

A researcher in the Science corpus: 2 papers; trusts 7 researchers and is trusted by 3 researchers here, as inferred from the citation graph.

Subfields

• Discrete Mathematics and Combinatorics — 6 citations into it; #1,691 of 2,017 by trust here, #1,949 by citations
• Geometry and Topology — 5 citations into it; #4,384 of 7,422 by trust here, #6,910 by citations

Whom Jie Han trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Peter Keevash
2. Allan Siu Lun Lo
3. Richard Mycroft
4. K. Markstrom
5. Vojtech Rödl
6. Richard M. Karp

Who trusts Jie Han overall

1. Alexandr V. Kostochka
2. Yi Zhao
3. Dhruv Mubayi

Papers from Jie Han's perspective

Ordered by how strongly the researchers Jie Han trusts endorse each paper. Same corpus, a different order for every researcher.

1. A Geometric Theory for Hypergraph Matching
2. Shadows and intersections: Stability and new proofs
3. $F$-factors in hypergraphs via absorption
4. A Dirac-Type Theorem for 3-Uniform Hypergraphs (Combinatorics, probability & computing)
5. Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)
6. Combinatorial theorems in sparse random sets
7. The existence of designs
8. Hamilton cycles in graphs and hypergraphs: an extremal perspective
9. Hypergraph regularity and the multidimensional Szemerédi theorem
10. Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)

Their papers

• Decision problem for Perfect Matchings in Dense k-uniform Hypergraphs (2014) — 54 citations
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family (2015) — 56 citations