Excluded subposets in the Boolean lattice
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
International audience We are looking for the maximum number of subsets of an n-element set not containing 4 distinct subsets satisfying $A ⊂B, C ⊂B, C ⊂D$. It is proved that this number is at least the number of the $\lfloor \frac{n }{ 2}\rfloor$ -element sets times $1+\frac{2}{ n}$, on the other hand an upper bound is given with 4 replaced by the value 2.
2015 ◽
Vol DMTCS Proceedings, 27th...
(Proceedings)
◽
Keyword(s):
2014 ◽
Vol DMTCS Proceedings vol. AT,...
(Proceedings)
◽
2021 ◽
Vol vol. 23, no. 3
(Graph Theory)
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
1986 ◽
Vol 108
(4)
◽
pp. 317-321
◽
Keyword(s):