Classical problems in discrete geometry

• Economical lattice coverings by determined segments , with Gennian Ge and Yang Shu.

• Kusner's conjecture: Exact values and linear bounds , with Hong-Jun Ge and Yang Zhou.

Extremal Set Theory

• Largest Sperner families with restricted differences , with Gennian Ge and Xiaochen Zhao.
• Beating the Ahlswede–Khachatrian bound for the Erdős–Frankl–Pach problem , with Tuan Tran.
• Largest 3-uniform set systems with VC-dimension 2 , with Jian Wang and Shengtong Zhang.
• Uniform set systems with small VC-dimension , with Ting-Wei Chao, Chi Hoi Yip, and Shengtong Zhang.

Combinatorial Convexity

• Tverberg's theorem for unions of convex sets: Sharp bounds and colored extensions , with Gennian Ge and Yang Shu.
• A Tverberg-type problem of Kalai: Two negative answers to questions of Alon and Smorodinsky, and the power of disjointness , with Wenchong Chen, Gennian Ge, Yang Shu, and Zhouningxin Wang.
• Balanced Sperner families via the topological Tverberg theorem , with Chong Shangguan and Yulin Yang.

Euclidean Ramsey theory

• Euclidean Gallai–Ramsey for various configurations , with Xinbu Cheng.
• Canonical Ramsey: triangles, rectangles and beyond , with Yijia Fang, Gennian Ge, Yang Shu, Qian Xu, and Dilong Yang.
• All simplices exhibit canonical Ramsey property , with Gennian Ge, Yang Shu, and Wenjun Yu.

Structure of dense graphs without certain subgraphs

• Beyond chromatic threshold via the (p,q)-theorem, and a sharp blow-up phenomenon , with Hong Liu, Chong Shangguan, and Jozef Skokan.
• Interpolating chromatic and homomorphism thresholds , with Xinqi Huang, Hong Liu, and Mingyuan Rong.