I am a PhD student at the Faculty of Mathematics and Computer Science, Leipzig University in Leipzig since June 2025, working under the supervision of Daniel Král’. Prior to that, I began my PhD studies at the Faculty of Informatics, Masaryk University in Brno since November 2022, following my supervisor. I received my master’s degree from the ShanDong University under the supervision of Guanghui Wang.

Contact details:
Office: P516, Augustuspl. 10, Leipzig
Email: shuxch15@gmail.com & xichao.shu@uni-leipzig,de

Publication

1. T.-W. Chao, Z. Dong, H. Liu, X. Shu, S. Wang: A dichotomy for hypergraph Zarankiewicz problems on axis-parallel boxes. preprint arXiv:2604.20815 (2026)
2. B. Kielak, D. Král’, A. Lamaison, X. Shu：Fundamental cycles in grid graphs. preprint arXiv:2604.17595 (2026)
3. D. Iľkovič, J. León, X. Shu: Multi-cyclic graphs in the random graph process with restricted budget. preprint arXiv:2412.17620 (2024).
4. J. Hladký, D. Iľkovič, J. León, X. Shu: On cospectral graphons. The Electronic Journal of Combinatorics, 33(1), (2026), P1.10.
5. M. Briański, D. Kráľ, A. Lamaison and X. Shu: Four-coloring Eulerian triangulations of the torus, preprint arXiv:2409.19165 (2024).
6. D. Kráľ, A. Lamaison, M. Prorok and X. Shu: The dimension of the region of feasible tournament profiles. SIAM Journal on Discrete Mathematics 39 (2025), Issue 2.
7. J. Han, X. Shu, G. Wang: Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs. Journal of Combinatorial Theory, Series B, 177 (2026), 1-30.
8. D. Yin, X. Zhang, X. Shu, G. Yan, G, Wang: Search for Good Irregular Low-Density Parity-Check Codes via Graph Spectrum. 2021 IEEE 32nd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp 405-410.
9. J. Han, X. Shu, G. Wang: Non-linear Hamilton cycles in linear quasirandom hypergraphs. ACM-SIAM Symposium on Discrete Algorithms 2021 (SODA21), pp 74-88.
10. X. Li, X. Shu, H. Huang, J. Bai: Capacitated partial inverse maximum spanning tree under the weighted Hamming distance. Journal of Combinatorial Optimization, 38, (2019), 1005-1018.

Talk

1. Invited Talk at the Center for Mathematics and Interdisciplinary Frontier Sciences, Shandong University, February 2025. Multi-cyclic graphs in the random graph process with restricted budget.
2. Combinatorics group seminar at the Institute of Computer Science of the Czech Academy of Sciences, November, 2024. Four-coloring Eulerian triangulations of the torus.
3. DIMEA Combinatorial Potluck 2024, October 2024. Four-coloring Eulerian triangulations of the torus.
4. The 41st Colloquium on Combinatorics (Kolloqium über Kombinatorik), October 2024. Four-coloring Eulerian triangulations of the torus.
5. Shandong University Young Mathematicians Forum, Series No. 12, April 2024. The dimension of the region of feasible tournament profiles.
6. The 1st Workshop on Development in Combinatorics, October 2021. Non-linear Hamilton cycles in linear quasi-random hypergraphs.
7. The 12th Computer Mathematics Conference of Chinese Mathematics Society, June 2021. Non-linear Hamilton cycles in linear quasi-random hypergraphs.
8. ACM-SIAM Symposium on Discrete Algorithms 2021 (SODA21), January 2021. Non-linear Hamilton cycles in linear quasi-random hypergraphs.