On Lower Bound for W(K_(2n))
classification
💻 cs.DM
keywords
boundlowercoloringcolorscompleteedgegraphgreatest
read the original 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}.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.