|
|
A267387
|
|
Number of acyclic orientations of the Turán graph T(n,7).
|
|
2
|
|
|
1, 1, 2, 6, 24, 120, 720, 5040, 35280, 287280, 2656080, 27422640, 312273360, 3884393520, 52370755920, 704126188080, 10259633739600, 160825241006640, 2696186419390800, 48104638617656880, 909616190783645520, 18163810790066314800, 361758057531039101520
(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
|
|
|
FORMULA
|
a(n) ~ n! / (6 * (1 - log(7/6))^3 * 7^n * (log(7/6))^(n+1)). - Vaclav Kotesovec, Feb 18 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|