Name
Abstract | ||
|---|---|---|
A subfamily G⊆F⊆2[n] of sets is a non-induced (weak) copy of a poset P in F if there exists a bijection i:P→G such that p≤Pq implies i(p)⊆i(q). In the case where in addition p≤Pq holds if and only if i(p)⊆i(q), then G is an induced (strong) copy of P in F. We consider the minimum number sat(n,P) [resp. sat⁎(n,P)] of sets that a family F⊆2[n] can have without containing a non-induced [induced] copy of P and being maximal with respect to this property, i.e., the addition of any G∈2[n]∖F creates a non-induced [induced] copy of P. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.jcta.2021.105497 | Journal of Combinatorial Theory, Series A |
Keywords | DocType | Volume |
Extremal set theory,Forbidden subposet problem,Saturation problem | Journal | 184 |
ISSN | Citations | PageRank |
0097-3165 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Keszegh | 1 | 156 | 24.36 |
| Nathan Lemons | 2 | 67 | 9.49 |
| Martin Ryan R. | 3 | 0 | 0.34 |
| Dömötör Pálvölgyi | 4 | 15 | 3.79 |
| Balázs Patkós | 5 | 85 | 21.60 |