Abstract
It is well known that for every even integer n, the complete graph \(K_{n}\) has a one-factorization, namely a proper edge coloring with \(n-1\) colors. Unfortunately, not much is known about the possible structure of large one-factorizations. Also, at present we have only woefully few explicit constructions of large one-factorizations. In particular, we know essentially nothing about the typical properties of one-factorizations for large n. In this view, it is desirable to find rapidly mixing Markov chains that generate one-factorizations uniformly and efficiently. No such Markov chain is currently known, and here we take a step this direction. We construct a Markov chain whose states are all edge colorings of \(K_n\) by \(n-1\) colors. This chain is invariant under arbitrary renaming of the vertices or the colors. It reaches a one factorization in polynomial(n) steps from every starting state. In addition, at every transition only O(n) edges change their color. We also raise some related questions and conjectures, and present results of numerical simulations of simpler variants of this Markov chain.
Similar content being viewed by others
References
Chatterjee, S.: An introduction to large deviations for random graphs. Bull. Amer. Math. Soc. 53, 617–642 (2016)
Dinitz, J., Stinson, D.: A hill-climbing algorithm for the construction of one-factorizations and room squares. SIAM J. Algebraic Discrete Methods 8, 430–438 (1987)
A. L. Drizen, Generating uniformly-distributed random generalised 2-designs with block size 3, PhD thesis, Queen Mary University of London (2012)
S. Glock, D. Kühn, A. Lo, and D. Osthus, The existence of designs via iterative absorption, preprint, arXiv:1611.06827 (2016)
S. Glock, D. Kühn, A. Lo, and D. Osthus, On a conjecture of Erdős on locally sparse Steiner triple systems, preprint, arXiv:1802.04227 (2018)
M. Hall, Combinatorial Theory, John Wiley & Sons (1967).
Jacobson, M.T., Matthews, P.: Generating uniformly distributed random latin squares. J. Combin. Des. 4, 405–437 (1996)
P. Kaski, A. de Souza Medeiros, P. R. Östergård, and I. M. Wanless, Switching in one-factorisations of complete graphs, Electron. J. Combin., 21 (2014), 2–49
Kaski, P., Östergård, P.R.J.: There are \(1,132,835,421,602,062,347\) nonisomorphic one-factorizations of \(K_{14}\). J. Combin. Des. 17, 147–159 (2009)
P. Keevash, The existence of designs, preprint, arXiv:1401.3665 (2014)
M. Kwan, Almost all Steiner triple systems have perfect matchings, preprint, arXiv:1611.02246 (2016)
D. A. Levin, Y. Peres, and E. L. Wilmer, Markov Chains and Mixing Times, American Mathematical Soc. (2009)
Linial, N., Luria, Z.: An upper bound on the number of Steiner triple systems. Random Structures Algorithms 43, 399–406 (2013)
Mendelsohn, E., Rosa, A.: One-factorizations of the complete graph - a survey. J. Graph Theory 9, 43–65 (1985)
W. D. Wallis, One-factorizations, Springer Science & Business Media (2013)
Acknowledgements
The authors would like to thank Amir Dembo and Michael Simkin for useful discussions, and the anonymous referee for their helpful suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Endre Szemerédi on his 80th birthday
Supported by ERC grant 339096 ”High dimensional combinatorics”.
Rights and permissions
About this article
Cite this article
Dotan, M., Linial, N. & Peled, Y. Efficient, local and symmetric Markov chains that generate one-factorizations. Acta Math. Hungar. 161, 557–568 (2020). https://doi.org/10.1007/s10474-020-01070-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10474-020-01070-1