The Shifted Turán Sieve Method on Tournaments

DOI10.4153/S000843951900016XzbMath1427.05008OpenAlexW2939128356MaRDI QIDQ5242549

Yu-Ru Liu, Wentang Kuo, Sávio Ribas, Kevin Zhou

Publication date: 12 November 2019

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/s000843951900016x

zbMATH Keywords

cycletournamentshifted Turán sieve

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Sieves (11N35)

Related Items (2)

Sieve methods in random graph theory ⋮ The shifted Turán sieve method on tournaments. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Longest cycles in almost regular 3-partite tournaments
• The combinatorics behind number-theoretic sieves
• Cycles through a given arc and certain partite sets in almost regular multipartite tournaments
• Sieve methods in combinatorics
• On \(n\)-partite tournaments with unique \(n\)-cycle
• On 5-Cycles and 6-Cycles in Regular n-Tournaments
• On the Score Sequence of an N-Partite Tournament
• On the Distribution of 4-Cycles in Random Bipartite Tournaments
• On a Theorem of Hardy and Ramanujan
• On The Number of Faces of a Convex Polytope
• The Maximum Number of Strongly Connected Subtournaments^*
• On the method of paired comparisons
• On cycles in regular 3-partite tournaments

This page was built for publication: The Shifted Turán Sieve Method on Tournaments