OFFSET
1,3
COMMENTS
A split graph is one which can be partitioned into a clique and an independent set.
a(n) is the number of sequences G[0], G[1], ..., G[n(n-1)/2] where each G[i] is a split graph with i edges and G[i] is a subgraph of G[i+1] for each i. All graphs are labeled.
LINKS
Brendan McKay, Table of n, a(n) for n = 1..14
CROSSREFS
KEYWORD
nonn,hard
AUTHOR
Brendan McKay, Jun 06 2021
STATUS
approved