A247157 - OEIS

A247157

Greatest number of colors possible for interval edge-colorings of the complete graph K_{2n}.

1, 4, 7, 11, 14, 18, 21, 26, 29, 33, 37, 41 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	LINKS	`Table of n, a(n) for n=1..12.` `Hrant H. Khachatrian, Petros A. Petrosyan, Interval edge-colorings of complete graphs, arXiv:1411.5661 [cs.DM], (20-November-2014)`
	CROSSREFS	`Sequence in context: A198269 A047345 A310728 * A087070 A310729 A198271` `Adjacent sequences: A247154 A247155 A247156 * A247158 A247159 A247160`
	KEYWORD	`nonn,hard,more`
	AUTHOR	`Joerg Arndt, Nov 21 2014`
	STATUS	`approved`

Last modified May 28 09:09 EDT 2022. Contains 354112 sequences. (Running on oeis4.)