Premature sets of 1-factors or how not to schedule round robin tournaments

DOI10.1016/0166-218X(82)90051-8zbMath0514.05045OpenAlexW2012535765MaRDI QIDQ1051003

Walter D. Wallis, Alexander Rosa

Publication date: 1982

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(82)90051-8

zbMATH Keywords

1-factorizationpremature sets of 1-factorstournament scheduling problem

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items

The edge-chromatic class of regular graphs of degree 4 and their complements, Equitable embeddings of Steiner triple systems, Repeated blocks in indecomposable twofold triple systems, Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021, A greedy algorithm for the social golfer and the Oberwolfach problem, A tutorial on graph models for scheduling round‐robin sports tournaments, There are 3155 nonisomorphic perfect one‐factorizations of K₁₆, The spectrum of maximal sets of one-factors, Round robin scheduling -- a survey, A polynomial-time algorithm to find an equitable home--away assignment, Sports tournaments, home-away assignments, and the break minimization problem, An application of Tutte's theorem to 1-factorization of regular graphs of high degree, On circular--linear one-factorizations of the complete graph, Embedding partial Steiner triple systems is NP-complete, On the intricacy of combinatorial construction problems

Cites Work

• On the number of 1-factorizations of the complete graph
• Combinatorics. Room squares, sum-free sets, Hadamard matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item