The unbalance of set systems

Nathan Lemons, Cory Palmer

Research output: Contribution to journalArticlepeer-review


The unbalance of an intersecting family F is defined as |F| -d(F), where d(F) is the maximum degree of F i.e. the maximum of |{F ∈ F : x ∈ F}| over all vertices x. We show that the unbalance of a k-uniform intersecting family is at most (k-2n-3) when n ≥ 6k3 and we determine all families achieving this bound.

Original languageEnglish
Pages (from-to)361-365
Number of pages5
JournalGraphs and Combinatorics
Issue number4
StatePublished - Sep 2008


  • Intersecting families
  • Intersecting set systems


Dive into the research topics of 'The unbalance of set systems'. Together they form a unique fingerprint.

Cite this