On Lower Bound for W(K_{2n})

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Discrete Mathematics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/144344

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0712.2567
 http://arxiv.org/abs/0712.2567
 Mathematical Problems of Computer Science 23, 2004, 127--129

Collections

arXiv