Set families with a forbidden induced subposet

From MaRDI portal
Publication:2908124




Abstract: For each poset H whose Hasse diagram is a tree of height k, we show that the largest size of a family cF of subsets of [n]=1,...,n not containing H as an induced subposet is asymptotic to (k1)nchoosefln/2. This extends the result of Bukh cite{bukh}, which in turn generalizes several known results including Sperner's theorem.









This page was built for publication: Set families with a forbidden induced subposet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908124)