On Lower Bound for W(K2n)
Abstract
The lower bound W(K2n)>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K2n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.