OFFSET
0,7
COMMENTS
An antichain is a set of sets, none of which is a subset of any other. It is covering if there are no isolated vertices.
The vertex-connectivity of a set-system is the minimum number of vertices that must be removed (along with any empty or duplicate edges) to obtain a non-connected set-system or singleton. Note that this means a single node has vertex-connectivity 0.
If empty edges are allowed, we have T(0,0) = 2.
EXAMPLE
Triangle begins:
1
1 0
1 1 0
4 3 2 0
30 40 27 17 0
546 1365 1842 1690 1451 0
MATHEMATICA
csm[s_]:=With[{c=Select[Subsets[Range[Length[s]], {2}], Length[Intersection@@s[[#]]]>0&]}, If[c=={}, s, csm[Sort[Append[Delete[s, List/@c[[1]]], Union@@s[[c[[1]]]]]]]]];
stableSets[u_, Q_]:=If[Length[u]==0, {{}}, With[{w=First[u]}, Join[stableSets[DeleteCases[u, w], Q], Prepend[#, w]&/@stableSets[DeleteCases[u, r_/; r==w||Q[r, w]||Q[w, r]], Q]]]];
vertConnSys[vts_, eds_]:=Min@@Length/@Select[Subsets[vts], Function[del, Length[del]==Length[vts]-1||csm[DeleteCases[DeleteCases[eds, Alternatives@@del, {2}], {}]]!={Complement[vts, del]}]]
Table[Length[Select[stableSets[Subsets[Range[n], {1, n}], SubsetQ], Union@@#==Range[n]&&vertConnSys[Range[n], #]==k&]], {n, 0, 4}, {k, 0, n}]
CROSSREFS
KEYWORD
AUTHOR
Gus Wiseman, Sep 09 2019
EXTENSIONS
a(21) from Robert Price, May 28 2021
STATUS
approved