Name
Abstract | ||
|---|---|---|
Given a poset P, a family F of elements in the Boolean lattice is said to be P-saturated if (1) F contains no copy of P as a subposet and (2) every proper superset of F contains a copy of P as a subposet. The maximum size of a P-saturated family is denoted by La(n,P), which has been studied for a number of choices of P. The minimum size of a P-saturated family, sat(n,P), was introduced by Gerbner et al. (2013), and parallels the deep literature on the saturation function for graphs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.disc.2017.06.010 | Discrete Mathematics |
Keywords | Field | DocType |
Posets,Saturation,Induced saturation | Complete bipartite graph,Discrete mathematics,Subset and superset,Combinatorics,Saturation (chemistry),Upper and lower bounds,Boolean algebra (structure),Logarithm,Star product,Mathematics,Partially ordered set | Journal |
Volume | Issue | ISSN |
340 | 10 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Ferrara | 1 | 31 | 10.52 |
| Bill Kay | 2 | 9 | 5.01 |
| Lucas Kramer | 3 | 15 | 1.57 |
| Ryan R. Martin | 4 | 36 | 10.12 |
| Benjamin Reiniger | 5 | 8 | 3.01 |
| Heather Smith | 6 | 1 | 3.16 |
| Eric Sullivan | 7 | 0 | 0.34 |