--
Paul Bastide
(LaBRI (Bordeaux))
summary: We show that given m disjoint chains in the Boolean lattice, we can create m disjoint skipless chains
that cover the same elements (where we call a chain skipless if any two consecutive elements differ in size by
exactly one). By using this result we are able to answer ...
