On Lower Bound for W(K_{2n})
arXiv:0712.2567
Abstract
The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.
3 pages
arXiv:0712.2567
The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.
3 pages