The ACO Seminar (2012-2013)

We study an analogue of the classic Turan problem for partially ordered sets, or posets. For a poset P, the induced Turan number is the maximum size of a family of elements in the N-dimensional Boolean lattice that does not contain P as an induced subposet. Boehnlein and Jiang obtained the asymptotics of the induced Turan number for posets whose Hasse diagram is a tree. Not much is known about other posets. We present bounds on the induced Turan number for series-parallel posets and the family of standard examples. This is joint work with Linyuan Lu.