Abstract
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 language | English |
---|---|
Pages (from-to) | 361-365 |
Number of pages | 5 |
Journal | Graphs and Combinatorics |
Volume | 24 |
Issue number | 4 |
DOIs | |
State | Published - Sep 2008 |
Keywords
- Intersecting families
- Intersecting set systems