| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656210 | Journal of Combinatorial Theory, Series A | 2009 | 9 Pages |
Abstract
A family of sets F⊆X2 is defined to be l-trace k-Sperner if for any subset Y of X with size l the trace of F on Y (the restriction of F to Y) does not contain any chain of length k+1. In this paper we investigate the maximum size that an l-trace k-Sperner family (with underlying set [n]={1,2,…,n}) can have for various values of k, l and n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
