2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/144344The 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 pagesDiscrete Mathematicstext