A246506 a(n) is the number m_0 with the property that if m >= m_0, then every graph obtained from the complete bipartite graph K_{m,m+n} by deleting two edges is chromatically unique.

7, 7, 7, 9, 11, 14, 17, 21, 25, 30

Offset

2,1

References

Reinaldo E. Guidici and Eduardo Lima de Sá, Chromatic uniqueness of certain bipartite graphs. Proceedings of the Twenty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1990). Congr. Numer. 76 (1990), 69-75. MR1140419 (92i:05094)

Links

Table of n, a(n) for n=2..11.

Crossrefs

Sequence in context: A252732 A360807 A011472 * A001733 A266952 A245423

Adjacent sequences: A246503 A246504 A246505 * A246507 A246508 A246509

Keyword

nonn,more

Author

N. J. A. Sloane, Aug 27 2014

Status

approved