Mar 28, 2012 · We study how large can a family of subsets of an n-set be that avoids containing a given finite poset P as a subposet. For two posets P=(P ...

Jun 15, 2011 · Abstract. Given a finite poset P, let La(n, P) denote the largest size of a family of subsets of an n-set that does not contain P as a ...

Given a finite poset P, let ${\rm La}(n,P)$ denote the largest size of a family of subsets of an n-set that does not contain P as a (weak) subposet.

Given a finite poset P, let ${\rm La}(n,P)$ denote the largest size of a family of subsets of an n-set that does not contain P as a (weak) subposet.

Jerrold R. Griggs, Wei-Tian Li : The partition method for poset-free families. J. Comb. Optim. 25(4): 587-596 (2013). manage site settings.

Feb 25, 2019 · Let m ⁡ ( n ) denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union.

Article "The partition method for poset-free families" Detailed information of the J-GLOBAL is an information service managed by the Japan Science and ...

The present authors [8] described a “partition method” for using the Lubell function to derive simple new proofs of several fundamental poset examples ...

Jun 1, 2017 · As a result of this procedure all outside layers sets will have zero total charge, and the middle layers sets will have charge not greater than ...

Poset-free families and Lubell-boundedness · On the size of the largest P-free families · The partition method for poset-free families · Families of Subsets ...