|
|
A372261
|
|
Number T(n,k,j) of acyclic orientations of the complete tripartite graph K_{n,k,j}; triangle of triangles T(n,k,j), n>=0, k=0..n, j=0..k, read by rows.
|
|
6
|
|
|
1, 1, 2, 6, 1, 4, 18, 14, 78, 426, 1, 8, 54, 46, 330, 2286, 230, 1902, 15402, 122190, 1, 16, 162, 146, 1374, 12090, 1066, 10554, 101502, 951546, 6902, 76110, 822954, 8724078, 90768378, 1, 32, 486, 454, 5658, 63198, 4718, 57054, 657210, 7290942, 41506, 525642, 6495534, 78463434, 928340190
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
An acyclic orientation is an assignment of a direction to each edge such that no cycle in the graph is consistently oriented. Stanley showed that the number of acyclic orientations of a graph G is equal to the absolute value of the chromatic polynomial X_G(q) evaluated at q=-1.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle of triangles T(n,k,j) begins:
1;
;
1;
2, 6;
;
1;
4, 18;
14, 78, 426;
;
1;
8, 54;
46, 330, 2286;
230, 1902, 15402, 122190;
;
...
|
|
MAPLE
|
g:= proc(n) option remember; `if`(n=0, 1, add(
expand(x*g(n-j))*binomial(n-1, j-1), j=1..n))
end:
T:= proc() option remember; local q, l, b; q, l, b:= -1, [args],
proc(n, j) option remember; `if`(j=1, mul(q-i, i=0..n-1)*
(q-n)^l[1], add(b(n+m, j-1)*coeff(g(l[j]), x, m), m=0..l[j]))
end; abs(b(0, nops(l)))
end:
seq(seq(seq(T(n, k, j), j=0..k), k=0..n), n=0..5);
|
|
CROSSREFS
|
T(n,k,0) for k=0..9 give: A000012, A000079, A027649, A027650, A027651, A283811, A283812, A283813, A284032, A284033.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|