Interview with Yufei Zhao
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- A new proof of Szemerédi's theorem
- A restriction estimate using polynomial partitioning
- A reverse Sidorenko inequality
- Algebraic methods in discrete analogs of the Kakeya problem
- An L^p theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- An entropy approach to the hard-core model on bipartite graphs
- An inverse theorem for the Gowers \(U^{s+1}[N]\)-norm
- Hypergraph containers
- Independent sets in hypergraphs
- Independent sets in regular graphs and sum-free subsets of finite groups
- Induced subgraphs of hypercubes and a proof of the sensitivity conjecture
- Large networks and graph limits
- Metrics for sparse graphs
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- On replica symmetry of large deviations in random graphs
- On the Erdős distinct distances problem in the plane
- On the number of graphs without 4-cycles
- On the size of Kakeya sets in finite fields
- On weighted graph homomorphisms
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- Restriction estimates using polynomial partitioning. II
- The Green-Tao theorem: an exposition
- The number of independent sets in a regular graph
- The number of independent sets in an irregular graph
- The primes contain arbitrarily long arithmetic progressions
This page was built for publication: Interview with Yufei Zhao
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056214)
