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

Simple item page
dc.creatorKamalian, Rafael R.
dc.creatorPetrosyan, Petros A.
dc.date2007-12-17
dc.date.accessioned2026-07-07T08:49:34Z
dc.date.available2026-07-07T08:49:34Z
dc.descriptionThe 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}.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/0712.2567
dc.identifierhttp://arxiv.org/abs/0712.2567
dc.identifierMathematical Problems of Computer Science 23, 2004, 127--129
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144344
dc.subjectDiscrete Mathematics
dc.titleOn Lower Bound for W(K_{2n})
dc.typetext

Files

Collections

arXiv