A304525 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A304525

Star chromatic indices of complete graphs.

0, 1, 3, 5, 9, 12, 14, 14, 18

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

The star chromatic index of a graph is the minimum number of colors needed to color the edges of a graph such that adjacent edges receive different colors and that on every path and cycle on four edges there are at least three different colors. The values a(n) are the star chromatic indices of the complete graph K_n. For the complete graph K_n, Dvořák, Mohar and Šámal conjectured that the star chromatic index is linear in n. For now, only the bounds up to n=9 are known. For n=10, the index is between 20 and 22.

LINKS

Table of n, a(n) for n=1..9.

Z. Dvořák, B. Mohar and R. Šámal, Star chromatic index, arXiv:1011.3376 [math.CO],

Z. Dvořák, B. Mohar and R. Šámal, Star chromatic index, J. Graph Theory 72 (2013), 313-326.

CROSSREFS

Sequence in context: A120806 A020946 A352596 * A310039 A091785 A191403

Adjacent sequences: A304522 A304523 A304524 * A304526 A304527 A304528

KEYWORD

nonn,hard

AUTHOR

Borut Lužar, May 14 2018

STATUS

approved