Maximum Hitting for n Sufficiently Large

Ben Barber

Research output: Contribution to journalArticle (Academic Journal)

1 Citation (Scopus)
246 Downloads (Pure)

Abstract

For a left-compressed intersecting family A⊆[n](r) and a set X⊆[n] , let A(X)={AA:AX≠∅} . 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.
Original languageEnglish
Pages (from-to)267-274
Number of pages8
JournalGraphs and Combinatorics
Volume30
Issue number2
Early online date16 Jan 2013
DOIs
Publication statusPublished - Mar 2014

Keywords

  • Intersecting family
  • Compression
  • Generating set
  • Erdős–Ko–Rado theorem

Fingerprint Dive into the research topics of 'Maximum Hitting for <i>n</i> Sufficiently Large'. Together they form a unique fingerprint.

Cite this