报告方式：线上报告，腾讯会议号446 4692 5794
邀请人：常虹博士
摘要：
Tournaments are among the most studied digraph classes. They have very nice path and cycle properties, such as traceability and Hamiltonicity, which have been known for a long time. In this talk, I will discuss some properties of tournaments involving cycles and paths of many lengths, say pancyclicity, cycle extendability and path extendability. The existence and number of paths of length 2 between every vertex pair is used as an important condition in our research, particularly when we consider doubly-regular tournaments and random tournaments.
简介：
张赞波现为广东财经大学统计与数学*女王调教-女王调教视频-女王 调教小说教授。他曾为广东省“千百十”人才培养工程省级培养对象，先后在中山大学和荷兰特文特大学（University of Twente）获得计算机和应用数学方向博士学位，主要从事图论及其算法等方面研究工作。他在SIAM J. on Discrete Mathematics，J. of Graph Theory等著名国际学术期刊上发表论文二十多篇，完成学术著作两本，在图的匹配理论，路圈理论，图划分算法和连通度算法等方向上取得系列成果，部分基础性成果被相关领域的专著和综述所引用。他主持完成广东省自然科学基金项目两项，现主持广东省重点科研项目一项。
