Maximum hitting for n sufficiently large

Details Maximum hitting for n sufficiently large Maximum hitting for n sufficiently large

2012-03-19

arxiv.org/abs/1203.4188v1

Mathematics

Combinatorics

7 pages

Scientific paper

For a left-compressed intersecting family \A contained in [n]^(r) and a set X
contained in [n], let \A(X) = {A in \A : A intersect X is non-empty}. Borg
asked: for which X is |\A(X)| maximised by taking \A to be all r-sets
containing the element 1? We determine exactly which X have this property, for
n sufficiently large depending on r.

Affiliated with

Also associated with

No associations

Rating

Maximum hitting for n sufficiently large does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum hitting for n sufficiently large, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum hitting for n sufficiently large will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213105