OFFSET
1,2
REFERENCES
B. Barber, Maximum hitting for n sufficiently large, Graphs and Combinatorics, 30 (2014), no. 2, 267-274.
LINKS
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.
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
KEYWORD
hard,more,nonn
AUTHOR
Ben Barber, Feb 24 2018
STATUS
approved