Guantao Chen (Georgia State University): Graph Edge Coloring

Zdeněk Dvořák (Charles University): On generalized coloring numbers

Yufei Zhao (MIT): Equiangular lines

Yifan Jing (Oxford): Sidon sets and sum-product phenomena

Anton Bernshteyn: A fast distributed algorithm for (Δ + 1)-edge-coloring

Yijia Chen (上海交通大学) Lovász meets Łoś and Tarski

Chong Shangguan (Shandong University): Some problems in extremal set theory

Xuding Zhu (Zhejiang Normal University) - Coloring, Sparseness and Girth

Shichang Song (北京交通大学): Applications of nonstandard analysis to graphon theory

Jaehoon Kim (KAIST): Extremal density for sparse minors and subdivisions

Randomized Greedy Algorithm for Independent Sets in Regular Uniform Hypergraphs

Peter Bradshaw (UIUC): Injective edge colorings of degenerate graphs

Annie Raymond: Graph Density Inequalities, Sums of Squares and Tropicalization

Torsten Mütze (Warwick): Combinatorial generation via permutation languages

Bernard Lidický (Iowa State U): Embedded graph 3-coloring and flows

Chun-Hung Liu (TAMU): Clustered coloring for Hadwiger type problems

Felix Joos: Decompositions of Hypergraphs

Shagnik Das (National Taiwan University): Isomorphic bisections of cubic graphs

王维凡：Simultaneous Colorings of Plane Graphs

Ilkyoo Choi: Relaxations of coloring squares of graphs