|
|
A361684
|
|
Ramsey core number rc(n,n).
|
|
3
|
|
|
2, 5, 8, 11, 15, 18, 22, 25, 28, 32, 35, 39, 42, 45, 49, 52, 56, 59, 62, 66, 69, 73, 76, 80, 83, 86, 90, 93, 97, 100, 103, 107, 110, 114, 117, 121, 124, 127, 131, 134, 138, 141, 144, 148, 151, 155, 158, 161, 165, 168, 172, 175, 179, 182, 185, 189, 192, 196, 199, 202
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The Ramsey core number rc(s,t) is the smallest n such that for all edge 2-colorings of K_n, either the factor induced by the first color contains an s-core or the second factor contains a t-core. (A k-core is a subgraph with minimum degree at least k.)
The beginning of the square array is:
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, ...
3, 5, 6, 8, 9, 10, 12, 13, 14, 15, 17, ...
4, 6, 8, 10, 11, 13, 14, 15, 17, 18, 19, ...
5, 8, 10, 11, 13, 15, 16, 18, 19, 20, 22, ...
6, 9, 11, 13, 15, 16, 18, 20, 21, 23, 24, ...
7, 10, 13, 15, 16, 18, 20, 21, 23, 25, 26, ...
8, 12, 14, 16, 18, 20, 22, 23, 25, 26, 28, ...
|
|
REFERENCES
|
R. Klein and J. Schönheim, Decomposition of K_{n} into degenerate graphs, In Combinatorics and Graph Theory Hefei 6-27, April 1992. World Scientific. Singapore, New Jersey, London, Hong Kong, 141-1.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = rc(n,n) = ceiling(2*n - 3/2 + sqrt(2*(n-1)^2 + 9/4)).
|
|
EXAMPLE
|
For order 5, one of the two factors has at least 5 edges, and so contains a cycle. For order 4, K_4 decomposes into two paths. Thus rc(2,2)=5.
|
|
MATHEMATICA
|
A361684[n_]:=Ceiling[2n-3/2+Sqrt[2(n-1)^2+9/4]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|