Contents

-

The Nonexistence of a Decomposition of Complete Graph K12 into Three Factors with Diameter Two

Ladislav Stacho1, Erik Urlandt 1
1 Institute for Informatics, Slovak Academy of Sciences, Diibravské 9, 842 35 Bratislava, Slovak Republic

Abstract

In this paper we show that the complete graph K12
is not decomposable into three factors of diameter two, thus
resolving a longstanding open problem. This result completes
the solution of decomposition of a complete graph into three
factors, one of which has diameter two and the other factors
have finite diameters.