Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

The Shifted Turan Sieve Method on Tournaments

Abstract

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.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”.Research partially supported by NSERC Discovery Grants || CAPES and CSF/CNPQ, Brazil

Similar works

Full text

thumbnail-image

University of Waterloo's Institutional Repository

redirect
Last time updated on 26/10/2023

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.