341
reads

Yu-Ru Liu  ( University of Waterloo, Canada )
2019-03-15  10:30 - 11:30
Room 202, Astronomy and Mathematics Building

We construct a shifted version of the Tur\\\'an sieve method and apply it to some counting problems on tournaments. More precisely, we obtain upper bounds for the number of tournaments which contain a fixed number of $r$-cycles. We also consider an analogous question on $t$-partite tournaments. This is a joint work with Wentang Kuo, S\\\'avio Ribas and Kevin Zhou.