The Shifted Turan Sieve Method on Tournaments

Loading...
Thumbnail Image

Date

2019

Authors

Kuo, Wentang
Liu, Yu-Ru
Ribas, Savio
Zhou, Kevin

Advisor

Journal Title

Journal ISSN

Volume Title

Publisher

Cambridge University Press

Abstract

Abstract. We construct a shi ed version of the Turán sieve method developed by R. Murty and the second author and apply it to counting problems on tournaments. More precisely, we obtain upper bounds for the number of tournaments which contain a fixed number of restricted r-cycles. These are the first concrete results which count the number of cycles over “all tournaments”.

Description

This article has been published in a revised form in the Canadian Mathematical Bulletin http://dx.doi.org/10.4153/S000843951900016X. This version is free to view and download for private research and study only. Not for re-distribution, re-sale or use in derivative works. Copyright © Canadian Mathematical Society 2019.

Keywords

shifted Turan sieve, tournament, cycle

LC Keywords

Citation