On the initial transition of graphs of Kirkman schedules by the partial team swap

Yusuke Kashiwagi, Masaki Yamamoto () and Takamasa Yashima ()
Additional contact information
Yusuke Kashiwagi: Seikei University
Masaki Yamamoto: Seikei University
Takamasa Yashima: Seikei University

Journal of Combinatorial Optimization, 2025, vol. 50, issue 1, No 3, 19 pages

Abstract: Abstract Kirkman schedule is one of the typical single round-robin (abbrev. SRR) tournaments. The partial team swap (abbrev. PTS) is one of the typical procedures of changing from an SRR tournament to another SRR tournament, which is used in local search for solving the traveling tournament problem. An SRR of n teams (of even number) can be represented by a 1-factorization of the complete graph $$K_n$$ K n . It is known that the 1-factorization of any Kirkman schedule is “perfect” when $$n=p+1$$ n = p + 1 for prime numbers p, meaning that any pair of 1-factors in the 1-factorization forms a Hamilton cycle $$C_n$$ C n in $$K_n$$ K n , called a 2-edge-colored Hamilton cycle. We are concerned with the cycle structure after applying the PTS to Kirkman schedules, that is, how a 2-edge-colored Hamilton cycle $$C_n$$ C n is decomposed into two 2-edge-colored cycles of length 2d and $$n-2d$$ n - 2 d , say, $$C_{2d}$$ C 2 d and $$C_{n-2d}$$ C n - 2 d for some number $$d\in [n/2]$$ d ∈ [ n / 2 ] . We characterize the numbers d such that any cycle $$C_{2d}$$ C 2 d is not generated by any PTS. Moreover, in case that a cycle $$C_{2d}$$ C 2 d is generated, we show that the number of $$C_{2d}$$ C 2 d for any $$d\ne n/4$$ d ≠ n / 4 generated by any PTS is at most $$n-2$$ n - 2 . For the case of $$d=n/4$$ d = n / 4 (i.e., $$C_{n/2}$$ C n / 2 ), the number of $$C_{n/2}$$ C n / 2 generated by any PTS is at most $$2(n-2)$$ 2 ( n - 2 ) , and there is some PTS to achieve the upper bound.

Keywords: Kirkman schedule; Perfect 1-factorization; Partial team swap (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01329-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01329-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01329-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().