Title：Quasi-pancyclic arcs in a quasi-Hamiltonian cycle of multipartite tournaments

Abstract：An arc of a digraph D is called pancyclic, if it lies on a t-cycle for all t∈{3,⋯,|V(D)|}. Moon ( On k-cyclic and pancyclic arcs in strong tournaments. J. Combin. Inform. System Sci. 19, 1994) proved that every strong tournament contains at least three pancyclic arcs. He noticed that if a tournament has exactly three pancyclic arcs, then all of them are contained in a common Hamiltonian cycle.

In this talk, we will give an overview on the number of pancyclic arcs in a Hamiltonian cycle of tournaments and consider the number of 〖quasi〗_x-pancyclic arcs in a〖quasi〗_y-Hamiltonian cycle of multipartite tournaments for x∈{p,l,o,nl,ps}, y∈{p,l,o}. We will also leave some open problems on this topic.

Speaker：Dr. Guo became a professor of Mathematics at RWTH Aachen University in 1999. Much of Guo's research over the years has focused on the fields of graph theory, discrete programming and its calculation methods, and computational complexity. He completed his doctoral dissertation entitled “Locally Semicomplete Digraphs”, and earned his Ph.D. from RWTH Aachen University in 1995. He is the author of more than 60 research articles, and serves as a reviewer for Mathematical Reviews (American Mathematical Society).

Date：4:00am-6:00pm 2022-5-26（Thursday）.

Tencent Meeting ID：163-517-343

Organizer：School of Mathematical Science

Students and teachers who are interested in graph theory are welcome.