@MISC{Elmasry_thesubset, author = {Amr Elmasry}, title = {The Subset Partial Order: . . . }, year = {} }

Bookmark

OpenURL

Abstract

Given a family F of k sets with cardinalities s1, s2,..., sk and N = ∑k i=1 si, we show that the size of the partial order graph induced by the subset relation (called the subset graph) is O ( ∑ si≤B 2s ∑