Maximum Hitting for n Sufficiently Large

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For a left-compressed intersecting family A ⊆[n](r) and a set X ⊆ [n], let (Formula Presented). Borg asked: for which X is {pipe}A(X){pipe} 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. © 2013 Springer Japan.

Cite

CITATION STYLE

APA

Barber, B. (2014). Maximum Hitting for n Sufficiently Large. Graphs and Combinatorics, 30(2), 267–274. https://doi.org/10.1007/s00373-012-1281-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free