|
| |
|
|
A247157
|
|
Greatest number of colors possible for interval edge-colorings of the complete graph K_{2n}.
|
|
0
|
|
|
|
1, 4, 7, 11, 14, 18, 21, 26, 29, 33, 37, 41
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,hard,more
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
