cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A267296 Circulant Ramsey numbers RC_1(3,n) of the first kind.

Original entry on oeis.org

3, 3, 9, 14, 15, 22, 25, 34, 37, 46, 49
Offset: 2

Views

Author

Jörgen Backelin, Jan 12 2016

Keywords

Comments

The smallest positive number a(n), such that any triangle-free cyclic (also known as circulant) graph with a(n) vertices has independence number at least n. The terminology and the terms given here are from Harborth and Krause.
a(n) <= A267295(n) for all n.
Moreover, the sequence is related to the ordinary two-color Ramsey numbers R(3,n), given in A000791, by the relation a(n) <= A000791(n) for all n, as proved by Kalbfleisch. This inequality is known to be an equality for n = 2 or 4 <= n <= 5.

References

  • H. Harborth, S. Krause, Ramsey Numbers for Circulant Colorings, Congressus Numerantium 161 (2003), 139-150.

Links

Crossrefs

Cf. A000791, A267295.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.