proposed

approved

editing

proposed

Cf. A001206, A006126, A048143, A051185, A134958, A030019, A304985, A305844.

allocatedNumber of labeled spanning intersecting set-systems foron Gusn Wisemanvertices.

1, 1, 3, 27, 1245, 1308285, 912811093455, 291201248260060977862887, 14704022144627161780742038728709819246535634969, 12553242487940503914363982718112298267975272588471811456164576678961759219689708372356843289

0,3

An intersecting set-system S is a finite set of finite nonempty sets (edges), any two of which have a nonempty intersection. S is spanning if every vertex is contained in some edge.

Inverse binomial transform of A051185.

The a(3) = 27 spanning intersecting set-systems:

{{1,2,3}}

{{1},{1,2,3}}

{{2},{1,2,3}}

{{3},{1,2,3}}

{{1,2},{1,3}}

{{1,2},{2,3}}

{{1,2},{1,2,3}}

{{1,3},{2,3}}

{{1,3},{1,2,3}}

{{2,3},{1,2,3}}

{{1},{1,2},{1,3}}

{{1},{1,2},{1,2,3}}

{{1},{1,3},{1,2,3}}

{{2},{1,2},{2,3}}

{{2},{1,2},{1,2,3}}

{{2},{2,3},{1,2,3}}

{{3},{1,3},{2,3}}

{{3},{1,3},{1,2,3}}

{{3},{2,3},{1,2,3}}

{{1,2},{1,3},{2,3}}

{{1,2},{1,3},{1,2,3}}

{{1,2},{2,3},{1,2,3}}

{{1,3},{2,3},{1,2,3}}

{{1},{1,2},{1,3},{1,2,3}}

{{2},{1,2},{2,3},{1,2,3}}

{{3},{1,3},{2,3},{1,2,3}}

{{1,2},{1,3},{2,3},{1,2,3}}

Length/@Table[Select[Subsets[Rest[Subsets[Range[n]]]], And[Union@@#==Range[n], FreeQ[Intersection@@@Tuples[#, 2], {}]]&], {n, 1, 4}]

Cf. A001206, A006126, A048143, A051185, A134958, A030019, A304985.

allocated

nonn

Gus Wiseman, Jun 11 2018

approved

editing

allocated for Gus Wiseman

allocated

approved