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

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

2007-12-17

arxiv.org/abs/0712.2567v1

Mathematical Problems of Computer Science 23, 2004, 127--129

Computer Science

Discrete Mathematics

3 pages

Scientific paper

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}.

Affiliated with

Also associated with

No associations

Rating

On Lower Bound for W(K_{2n}) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Lower Bound for W(K_{2n}), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Lower Bound for W(K_{2n}) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115511