Xichao Shu

Xichao Shu

Masaryk University

About me

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: A508, Augustuspl. 10, Leipzig
Email: shuxch15@gmail.com

Publication

  1. D. Iľkovič, J. León, X. Shu: Multi-cyclic graphs in the random graph process with restricted budget. preprint arXiv:2412.17620 (2024).
  2. J. Hladký, D. Iľkovič, J. León, X. Shu: On cospectral graphons. preprint arXiv:2411.13229 (2024)
  3. M. Briański, D. Kráľ, A. Lamaison and X. Shu: Four-coloring Eulerian triangulations of the torus, preprint arXiv:2409.19165 (2024).
  4. D. Kráľ, A. Lamaison, M. Prorok and X. Shu: The dimension of the region of feasible tournament profiles, preprint arXiv:2310.19482 (2023).
  5. J. Han, X. Shu, G. Wang: Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs. Submitted.
  6. 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.
  7. 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.
  8. 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. The 41st Colloquium on Combinatorics (Kolloqium über Kombinatorik), October 2024. Four-coloring Eulerian triangulations of the torus.
  2. ACM-SIAM Symposium on Discrete Algorithms 2021 (SODA21), January 2021. Non-linear Hamilton cycles in linear quasi-random hypergraphs.
  3. The 12th Computer Mathematics Conference of Chinese Mathematics Society, June 2021. Non-linear Hamilton cycles in linear quasi-random hypergraphs.
  4. The 1st Workshop on Development in Combinatorics, October 2021. Non-linear Hamilton cycles in linear quasi-random hypergraphs.