The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #11 Mar 30 2024 03:01:27
%S 7,7,7,9,11,14,17,21,25,30
%N 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.
%D 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)
%K nonn,more
%O 2,1
%A _N. J. A. Sloane_, Aug 27 2014