Yufei Zhao

Discrete Mathematics and Combinatorics · 2009–2019

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

Subfields

• Discrete Mathematics and Combinatorics — 38 citations into it; #1,064 of 2,017 by trust here, #812 by citations
• Computational Theory and Mathematics — 33 citations into it; #11,810 of 12,182 by trust here, #7,851 by citations
• Geometry and Topology — 33 citations into it; #4,210 of 7,422 by trust here, #3,762 by citations
• Algebra and Number Theory — 11 citations into it; #1,649 of 2,864 by trust here, #2,392 by citations
• Mathematical Physics — 8 citations into it
• Numerical Analysis — 7 citations into it
• Electrical and Electronic Engineering — 5 citations into it

Whom Yufei Zhao trusts overall

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

1. Maria Bras-Amorós
2. Melvyn B. Nathanson
3. William T. Gowers
4. Ben Joseph Green
5. Peter V. Hegarty
6. Terence Tao
7. Christian Borgs
8. Henry Cohn
9. L. Lov'asz
10. D. Goldston

Who trusts Yufei Zhao overall

1. Nathan Kaplan
2. Alex Zhai

Papers from Yufei Zhao's perspective

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

1. The primes contain arbitrarily long arithmetic progressions
2. Dense Subsets of Pseudorandom Sets
3. Counting Graph Homomorphisms
4. Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics
5. A Szemerédi-type regularity lemma in abelian groups, with applications
6. The On-Line Encyclopedia of Integer Sequences (Electronic Journal of Combinatorics)
7. Upper tails for subgraph counts in random graphs
8. Hypergraph regularity and the multidimensional Szemerédi theorem
9. Regularity Lemma for k‐uniform hypergraphs (Random Struct. Algorithms)
10. Recurrence of Distributional Limits of Finite Planar Graphs

Their papers

• A relative Szemerédi theorem (2013) — 62 citations
• Upper tails and independence polynomials in random graphs (2015) — 62 citations
• Equiangular lines with a fixed angle (2019) — 80 citations
• An $L^{p}$ theory of sparse graph convergence II: LD convergence, quotients and right convergence (2014) — 98 citations
• SPHERE PACKING BOUNDS VIA SPHERICAL CODES (2012) — 105 citations
• Constructing numerical semigroups of a given genus (2009) — 46 citations
• Sets characterized by missing sums and differences (2009) — 46 citations