10:30 am, Lecture Hall 2
Counting cycles in a 2-dimensional tournament
University of Kentucky.
Tournament graphs are a class of directed graphs with important applications in logistics, flows in networks etc. The combinatorial study of these graphs has been an active area of research.
I will begin this talk with a discussion on the problem of counting the number of directed 3-cycles in a tournament graph. This problem has interesting generalisation in higher dimensions; I will sketch the proof of one such generalisation.