OFFSET
0,5
COMMENTS
Also, T(n,k) is the number of spanning subgraphs of the complete bipartite graph K_{n,n} that have bipartite dimension (or biclique covering number) k.
LINKS
Mathematics Stack Exchange, Calculating the rank of a Boolean matrix and Boolean matrix factorization
Wikipedia, Bipartite dimension
Wikipedia, Boolean matrix
EXAMPLE
Triangle begins:
n\k | 0 1 2 3 4 5
----+--------------------------------------
0 | 1
1 | 1 1
2 | 1 9 6
3 | 1 49 306 156
4 | 1 225 8550 40656 16104
5 | 1 961 194850 5771100 21165720 6421800
CROSSREFS
KEYWORD
AUTHOR
Pontus von Brömssen, Jun 29 2022
STATUS
approved