Chong Shangguan (Shandong University): Some problems in extremal set theory
Songling Shan (Auburn University): Towards the Overfull Conjecture
汪彦(上海交通大学) Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Sam Spiro (Rutgers University): Card Guessing with Feedback
Richard Peng (CMU): Learning Augmented B^{-}-Trees
Shichang Song (北京交通大学): Applications of nonstandard analysis to graphon theory
Bernard Lidický (Iowa State U): Embedded graph 3-coloring and flows
林辉球 (华东理工大学) On sum of powers of graph eigenvalues: problems and progress
Felix Cleman (IBS): Triangles in the Plane
Patrice Ossona de Mendez (CNRS and Univ. of Charles) Twin-width and permutations
József Balogh (UIUC): The Hypergraph Container Method
Hal Kierstead (ASU): Sparsity from a game theoretic perspective
Marcelo Campos (Oxford)：An exponential improvement to diagonal Ramsey
Peter Frankl (Rényi): Old and new problems in extremal set theory
2. Forbidding a subgraph I- Mantel's theorem and Turán's theorem
Marius Tiba (University of Oxford): Erdős covering systems
Yijia Chen (上海交通大学) Lovász meets Łoś and Tarski
1. A bridge between graph theory and additive combinatorics
王周宁馨 (Université Paris Cité): Density of C_{−4}-critical signed graphs
Yongtang Shi (南开大学): Planar Turán number of graphs
