报告人：Sergey Kitaev（University of Strathclyde）

时间：2024年06月28日  09:00-12:00

地址：数统学院LD302

摘要：

Lecture 13. Word-representable graphs, semi-transitive orientations

简介：Sergey Kitaev. Professor of Mathematics, University of Strathclyde.Associate Dean (Research), Faculty of Science.Head of the Strathclyde Combinatorics Group.Editor of Journal of Combinatorial Theory, Series A and Proceedings of Edinburgh Mathematical Society.Author of 165+ publications including two Springer books.In the list of most cited mathematicians by graduation year.Invited Speaker at Algorithms and Software for Discrete Computational Mathematics, International Conference on Riordan Arrays and Related Topics, International Conference on Developments in Language Theory, International Permutation Patterns Conference, AMSMAA Joint Meetings and several other events.Leverhulme Research Fellow (2023-24).Chair of 26th British Combinatorial Conference, BCC 2017.

邀请人：数学研究中心

欢迎广大师生积极参与！