Amedeo Sgueglia

On Kotzig's conjecture in random graphs

In 1963, Anton Kotzig famously conjectured that K n , the complete graph of order n , where n is even, can be decomposed into n − 1 perfect matchings such that every pair of these matchings forms a Hamilton cycle. The problem is still wide open and here we consider a variant of i...