Patkós Balázs: Induced and non-induced poset saturation problems

Description of video

Date: 3/26/20
Speaker :Patkós Balázs


    A subfamily GF2[n] of sets is a non-induced (weak) copy of a poset P in F if there exists a bijection i:PG such that pPq implies i(p)i(q). In the case where in addition pPq 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 F2[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