A247157 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A247157

Greatest number of colors possible for interval edge-colorings of the complete graph K_{2n}.

%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