On Lower Bound for W(K_{2n})
Rafael R. Kamalian, Petros A. Petrosyan
TL;DR
This paper establishes a lower bound of 3n-2 for the maximum number of colors in an interval edge coloring of the complete graph with 2n vertices, advancing understanding of coloring bounds.
Contribution
It proves a new lower bound for the maximum colors in interval edge colorings of complete graphs with even vertices.
Findings
W(K_{2n}) >= 3n - 2
Advances bounds in interval edge coloring theory
Provides a key inequality for complete graphs
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}.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph Labeling and Dimension Problems