A300099 The number of maximal left-compressed intersecting families of sets of size n from [m] when m >= 2n.

1, 2, 6, 72, 37145, 1081162102034

Offset

1,2

References

B. Barber, Maximum hitting for n sufficiently large, Graphs and Combinatorics, 30 (2014), no. 2, 267-274.

Links

Table of n, a(n) for n=1..6.

B. Barber, Maximum hitting for n sufficiently large, arXiv:1203.4188 [math.CO], 2012.

B. Barber, Partition regularity and other combinatorial problems, PhD thesis, University of Cambridge, 2014.

B. Barber, The number of maximal left-compressed intersecting families

Example

For n=2 the a(2)=2 maximal left-compressed intersecting families of 2-sets are the star of all sets containing 1, and the set of all 2-sets from {1,2,3}.

Crossrefs

Sequence in context: A117515 A265936 A085865 * A061296 A019993 A357024

Adjacent sequences: A300096 A300097 A300098 * A300100 A300101 A300102

Keyword

hard,more,nonn

Author

Ben Barber, Feb 24 2018

Status

approved