login
Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) is the maximal number of colors in a vertex coloring of the cube graph Q_n such that no subgraph Q_k is a rainbow.
0

%I #27 Jun 15 2023 16:27:41

%S 1,1,3,1,5,7,1,9,13,15,1,17,25,29,31,1,33,49,57,61,63,1,65

%N Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) is the maximal number of colors in a vertex coloring of the cube graph Q_n such that no subgraph Q_k is a rainbow.

%H Jens-P. Bode, Heiko Harborth, Meinhard Möller, and Hauke Nienborg, <a href="https://www.researchgate.net/publication/265834857_Vertex_rainbow_numbers_for_cube_graphs">Vertex rainbow numbers for cube graphs</a>, Congressus Numerant., 203 (2010), 167-174.

%H Workshop, <a href="https://umv.science.upjs.sk/c&amp;c/history/10abs.pdf">Cycles and Colourings 2010</a>, P. J. Šafárik University. See pp. 2-3.

%e Triangle begins:

%e 1

%e 1 3

%e 1 5 7

%e 1 9 13 15

%e 1 17 25 29 31

%e 1 33 49 57 61 63

%e 1 65 89-97 113 121 125 127

%e ...

%K nonn,tabl,more

%O 1,3

%A _N. J. A. Sloane_, Apr 14 2011