|
%I #9 Nov 22 2014 02:31:42
%S 1,4,7,11,14,18,21,26,29,33,37,41
%N Greatest number of colors possible for interval edge-colorings of the complete graph K_{2n}.
%H Hrant H. Khachatrian, Petros A. Petrosyan, <a href="http://arxiv.org/abs/1411.5661">Interval edge-colorings of complete graphs</a>, arXiv:1411.5661 [cs.DM], (20-November-2014)
%K nonn,hard,more
%O 1,2
%A _Joerg Arndt_, Nov 21 2014
|
