Multicolour chain avoidance in the boolean lattice

Abstract

Given a collection of colored chain posets, we estimate the number of colored subsets of the boolean lattice which avoid all chains in the collection.

Updated to add reference, 13 pages, comments welcome!

References in corpus (2)

• A random version of Sperner's theorem
• Multicolour containers and the entropy of decorated graph limits