Name
Abstract | ||
|---|---|---|
For a finite set system H with ground set X , we let H ∨ H = {A ∪ B: A, B ∈ H , A ≠ B} . An atom of H is a nonempty maximal subset C of X such that for all A ∈ H , either C ⊂ A or C ∩ A = 0. We obtain a best possible upper bound for the number of atoms determined by a set system H with ∥ H ∥ = k and ∥ H ∨ H ∥ = u for all integers k and u . This answers a problem posed by Sós. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0012-365X(95)00184-X | Discrete Mathematics |
Keywords | Field | DocType |
set system,pairwise union,fixed number,upper bound | Integer,Discrete mathematics,Pairwise comparison,Combinatorics,Finite set,Upper and lower bounds,Atom,Mathematics | Journal |
Volume | Issue | ISSN |
150 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |