|
| |
|
|
A191874
|
|
Number of n X n (0,1) matrices that achieve the record mentioned in A191873.
|
|
4
|
|
|
|
1, 1, 1, 8, 405, 2520, 4320, 32781000, 256556160, 10590199200, 2225341641600, 28746722188800
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,4
|
|
|
COMMENTS
|
Also, number of directed graphs on n labeled nodes that do not contain a subgraph isomorphic to the complete directed bipartite graph K_{2,2} and have largest number of edges (=A191873(n)). - Max Alekseyev, Feb 07 2022
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,more
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
