

A300099


The number of maximal leftcompressed intersecting families of sets of size n from [m] when m >= 2n.


0




OFFSET

1,2


REFERENCES

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


LINKS



EXAMPLE

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


CROSSREFS



KEYWORD

hard,more,nonn


AUTHOR



STATUS

approved



