On Lower Bound for W(K_{2n})
Discrete Mathematics
2007-12-18 v1
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}.
Keywords
Cite
@article{arxiv.0712.2567,
title = {On Lower Bound for W(K_{2n})},
author = {Rafael R. Kamalian and Petros A. Petrosyan},
journal= {arXiv preprint arXiv:0712.2567},
year = {2007}
}
Comments
3 pages
Related papers
View all related →
Discrete Mathematics · Computer Science
Interval edge-colorings of complete graphs
Hrant H. Khachatrian, Petros A. Petrosyan
2016-04-01
Discrete Mathematics · Computer Science
Interval Colourings of Some Regular Graphs
Rafael R. Kamalian, Petros A. Petrosyan
2007-12-20
Combinatorics · Mathematics
Minimal colorings for properly colored subgraphs in complete graphs
Chunqiu Fang, Ervin Győri, Jimeng Xiao
2019-11-12
Combinatorics · Mathematics
Interval edge-colorings of Cartesian products of graphs II
Petros A. Petrosyan, Hrant H. Khachatrian, Hovhannes G. Tananyan
2024-09-27
Combinatorics · Mathematics
Counting Gallai 3-colorings of complete graphs
Josefran de Oliveira Bastos, Fabricio Siqueira Benevides, Guilherme Oliveira Mota, Ignasi Sau
2018-05-18
Combinatorics · Mathematics
New lower bounds on the size-Ramsey number of a path
Deepak Bal, Louis DeBiasio
2021-11-05
Computational Geometry · Computer Science
On the 2-colored crossing number
Oswin Aichholzer, Ruy Fabila-Monroy, Adrian Fuchs, Carlos Hidalgo-Toscano +3
2019-09-13
Combinatorics · Mathematics
An explicit edge-coloring of K_n with six colors on every K_5
Alex Cameron
2017-04-07
Data Structures and Algorithms · Computer Science
Beyond the Shannon's Bound
Michał Farnik, Łukasz Kowalik, Arkadiusz Socała
2013-09-25
Discrete Mathematics · Computer Science
Tight Lower Bound for Multicolor Discrepancy
Pasin Manurangsi, Raghu Meka
2025-10-14
Combinatorics · Mathematics
A note on interval colourings of graphs
Maria Axenovich, António Girão, Lawrence Hollom, Julien Portier +4
2024-08-13
Combinatorics · Mathematics
Sharp bounds for covering with large cliques and independent sets
Veronica Bitonti, Emma Hogan, Tommy Walker Mackay
2026-04-24
Combinatorics · Mathematics
Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
Alain Hertz, Hadrien Mélot, Sébastien Bonte, Gauvain Devillez
2024-03-11
Combinatorics · Mathematics
Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
Arash Ahadi, Ali Dehghan
2017-02-06
Discrete Mathematics · Computer Science
A note on interval edge-colorings of graphs
R. R. Kamalian, P. A. Petrosyan
2010-08-13
Combinatorics · Mathematics
On generalised majority edge-colourings of graphs
Paweł Pękała, Jakub Przybyło
2023-09-29
Computational Complexity · Computer Science
On the dynamic width of the 3-colorability problem
Albert Atserias, Anuj Dawar, Oleg Verbitsky
2014-02-18
Combinatorics · Mathematics
Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
Carl Johan Casselgren, Hrant H. Khachatrian, Petros A. Petrosyan
2016-11-22
Combinatorics · Mathematics
Bounds on the 2-rainbow domination number of graphs
Yunjian Wu, N. Jafari Rad
2010-05-07
Discrete Mathematics · Computer Science
Colouring of (P3UP2)-free graphs
Arpitha P. Bharathi, Sheshayya A. Choudum
2018-02-22
Combinatorics · Mathematics
New lower bounds for the number of $(\leq k)$-edges and the rectilinear crossing number of $K_n$
Oswin Aichholzer, Jesús García, David Orden, Pedro Ramos
2020-07-21
Combinatorics · Mathematics
A $(5,5)$-coloring of $K_n$ with few colors
Alex Cameron, Emily Heath
2017-02-22
Combinatorics · Mathematics
Edge-colorings avoiding patterns in a triangle
Carlos Hoppen, Hanno Lefmann, Dionatan Ricardo Schmidt
2022-09-16
Combinatorics · Mathematics
Tight Chromatic Upper Bound for {3 Times K1, {2 Times K1 + (K2 UNION K1)}-free Graphs
Medha Dhurandhar
2015-04-28
Combinatorics · Mathematics
Almost-rainbow edge-colorings of some small subgraphs
Elliot Krop, Irina Krop
2014-02-04