SPEAKER: Professor Zhang Zanbo, Guangdong university of Finance & Economics
WHEN: 2021, January 8, 18:30
WHERE: Tencent meeting 446 4692 5794
ABSTRACT：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.