Chong Shangguan (Shandong University): Some problems in extremal set theory
Felix Cleman (IBS): Triangles in the Plane
Peter Frankl (Rényi): Old and new problems in extremal set theory
András Sebő (CNRS): The Salesman and the Postman
汪彦(上海交通大学) Vertex degree sums for perfect matchings in 3-uniform hypergraphs
Sam Spiro (Rutgers University): Card Guessing with Feedback
Xiaofan Yuan (Arizona State University): On Rainbow Thresholds
陈耀俊（南京大学）：Ramsey numbers concerning quadrilaterals
王周宁馨 (Université Paris Cité): Density of C_{−4}-critical signed graphs
Bernard Lidický (Iowa State U): Embedded graph 3-coloring and flows
Randomized Greedy Algorithm for Independent Sets in Regular Uniform Hypergraphs
Marcelo Campos (Oxford)：An exponential improvement to diagonal Ramsey
Bojan Mohar (Simon Fraser): Random embeddings of graphs in surfaces
Hal Kierstead (ASU): Sparsity from a game theoretic perspective
Marius Tiba (University of Oxford): Erdős covering systems
Songling Shan (Auburn University): Towards the Overfull Conjecture
林辉球 (华东理工大学) On sum of powers of graph eigenvalues: problems and progress
2. Forbidding a subgraph I- Mantel's theorem and Turán's theorem
Ziqing Xiang (Academia Sinica/南方科技大学): Line graphs over the binary field
Yijia Chen (上海交通大学) Lovász meets Łoś and Tarski
