CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
The Shifted Turan Sieve Method on Tournaments
Authors
Wentang Kuo
Yu-Ru Liu
Savio Ribas
Kevin Zhou
Publication date
1 January 2019
Publisher
Cambridge University Press
Doi
Cite
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
Open in the Core reader
Download PDF
Available Versions
University of Waterloo's Institutional Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:uwspace.uwaterloo.ca:10012...
Last time updated on 26/10/2023