Universal third parts of any complete 2-graph and none of DK_{5}

It is shown that there is no digraph \(F\) which could decompose the complete digraph on 5 vertices minus any 2-arc remainder into three parts isomorphic to \(F\) for each choice of the remainder. On the other hand, for each \(n\ge3\) there is a universal third part \(F\) of the complete 2-graph \(^...

Full description

Bibliographic Details
Main Authors: Artur Fortuna, Zdzisław Skupień
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2013-01-01
Series:Opuscula Mathematica
Subjects:
Online Access:http://www.opuscula.agh.edu.pl/vol33/4/art/opuscula_math_3338.pdf