Cycles in Regular Multipartite Tournaments
math.CO
Submitted: 2026-11-04
Updated: 2026-11-04
Comments: 16pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: We study balanced cycles in regular multipartite tournaments.
Terminology
Abstract
We study balanced cycles in regular multipartite tournaments. A cycle in a c-partite tournament is k-balanced if it contains exactly k vertices from each partite class. We prove that there exists an absolute integer r 0 such that every regular c-partite tournament with each partite class size of r at least r 0 contains a k-balanced cycle for every 1 at most k at most r when c=3 or c at least5, and for every 2 at most k at most r when c=4. In particular, our result confirms three conjectures of Volkmann and Winzen for large regular multipartite tournaments. We also confirm Yeo's conjecture on the existence of (p,q) -cycle factors for large regular c-partite tournaments G with c at least4, where a (p,q) -cycle factor is a pair of vertex-disjoint cycles of lengths p and q spanning G.
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality