Summary of the 2025
“Symposium on Graph Theory and Combinatorics”
at Tianyuan Mathematics Research Center
The “Symposium on Graph Theory and Combinatorics” organized by Xujin Chen (Professor, Academy of Mathematics and Systems Science, CAS), Jie Ma (Professor, University of Science and Technology of China) and Guanghui Wang (Professor, Shandong University) was successfully held at the Tianyuan Mathematics Research Center from October 19 to 25, 2025. The event brought together 33 participants from various universities and research institutions. Presentations covered the latest advances and future directions in the field of graph theory and combinatorics.
The symposium aims to provide a platform for young scholars in the fields of Graph Theory and Combinatorics to present their latest research findings, focusing on nurturing young scholars, addressing challenges in academic research, and supporting their growth. The symposium successfully gathered a cohort of early-career researchers at the forefront of their fields. Attendees held positions as postdoctoral fellows, lecturers, and assistant professors from prestigious institutions including Beijing Jiaotong University, Beijing Institute of Technology, Beijing University of Posts and Telecommunications, Fuzhou University, Central China Normal University, Nankai University, Qingdao University, Shandong University, Shandong University of Technology, Shaanxi Normal University, Shanghai Jiao Tong University, The University of Hong Kong, Xinjiang University, Zhejiang Normal University, University of Science and Technology of China, Academy of Mathematics and Systems Science (CAS) and Renmin University of China.
The scheduled 8 talks mainly focus on key topics in areas including extremal combinatorics, graph structure and combinatorial optimization. Mengyu Cao from Remin University of China presented maximal size and stability results for intersecting families in multiset settings. Guorong Gao from Fuzhou University discussed foundational and recent results on extremal problems related to complete bipartite graphs and their extensions to hypergraphs. Suyun Jiang from Jianghan University investigated the relationship between Turán density and Ramsey-Turán density for hypergraphs. Linpeng Zhang from Shandong University extended a recent breakthrough for 3-graphs by determining the optimal minimum codegree threshold for perfect tilings in 
-graphs. Yi Zhang from Beijing University of Posts and Telecommunications proved an asymptotically tight, rainbow version of a known degree-sum condition for the existence of perfect matchings in 3-uniform hypergraphs. Fuhong Ma from Shandong University of Technology explored the minimum semi-degree condition that guarantees a directed 4-cycle factor in a digraph. Rongchuan Tao from The University of Hong Kong presented results on the structure of graphs with integral associated polyhedral. Mengxi Yang from University of Science and Technology of China focused on Seymour graphs, characterizing their global structure and presenting a combinatorial algorithm to find maximum integral biflows.
The Symposium on Graph Theory and Combinatorics was a well-organized, intensive academic gathering that effectively achieved its goal of supporting young scholars. By bringing together a talented group of researchers in a secluded environment, it facilitated the exchange of groundbreaking ideas across key areas of combinatorics, from extremal problems and hypergraph theory to structural graph theory and combinatorial optimization. By fostering this community through intensive discussion, the symposium was not just presenting research; it was actively strengthening the institutional and relational networks that ensure the long-term health of the field of graph theory and combinatorics.