2 problems

Let a Steiner triple system of order $n$ be a $3$-uniform hypergraph on $n$ vertices in which every pair lies in exactly one edge, and let a perfect matching be a set of $n/3$ pair…

Let $P$ be a finite connected poset. Let $e(P)$ and $e^*(P)$ be the consecutive-level parameters, and let $d(P)$ and $d^*(P)$ be the minimum ratios defined over connected subposets…