Name
Abstract | ||
|---|---|---|
A family of sets F@?2^X 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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.jcta.2009.02.003 | Journal of Combinatorial Theory Series A |
Keywords | DocType | Volume |
subset Y,underlying set,size l,l-trace k-Sperner,sets F,maximum size,length k,l-trace k-Sperner family,various value | Journal | 116 |
Issue | ISSN | Citations |
5 | 0097-3165 | 1 |
PageRank | References | Authors |
0.37 | 4 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Patkós | 1 | 85 | 21.60 |