On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs

DOI10.1080/09720529.2020.1714884zbMATH Open1487.05085OpenAlexW3024923643WikidataQ114099787 ScholiaQ114099787MaRDI QIDQ5865698FDOQ5865698

Authors: J. Calatayud, M. Jornet 

Publication date: 9 June 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2020.1714884

zbMATH Keywords

complete graphone-factorizationproper edge coloringlocal minimum coloringmild random walk algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random walks on graphs (05C81)

Cites Work

• The Colour Numbers of Complete Graphs
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• One-factorizations of the complete graph—A survey
• Title not available (Why is that?)
• On one-factorizations of complete graphs
• Efficient, local and symmetric Markov chains that generate one-factorizations

This page was built for publication: On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5865698)