OFFSET
2,1
COMMENTS
The smallest number a(n), such that any triangle-free cyclic (also known as circulant) graph with at least a(n) vertices has independence number at least n. The terminology and the terms given here are from Harborth and Krause (2003); however, in another form, essentially they were considered and partly calculated already by Kalbfleich in 1965.
REFERENCES
H. Harborth, S. Krause: Ramsey Numbers for Circulant Colorings, Congressus Numerantium 161 (2003), 139-150.
LINKS
J. G. Kalbfleisch, Construction of special edge-chromatic graphs, Canad. Math. Bull., 8 (1965), 575-584.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Jörgen Backelin, Jan 12 2016
STATUS
approved