Pages that link to "Item:Q5262057"
From MaRDI portal
The following pages link to Supersaturation in the Boolean lattice (Q5262057):
Displaying 19 items.
- Saturating Sperner families (Q367051) (← links)
- On saturated \(k\)-Sperner systems (Q405311) (← links)
- Supersaturation and stability for forbidden subposet problems. (Q490923) (← links)
- On the number of monotone sequences (Q490988) (← links)
- Comparable pairs in families of sets (Q490990) (← links)
- Packing and covering k-chain free subsets in Boolean lattices (Q1043999) (← links)
- Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains (Q1644964) (← links)
- Supersaturation in posets and applications involving the container method (Q1679331) (← links)
- Long symmetric chains in the Boolean lattice (Q1919667) (← links)
- A generalization of the independence number (Q2172382) (← links)
- Structure and supersaturation for intersecting families (Q2420562) (← links)
- Supersaturation, counting, and randomness in forbidden subposet problems (Q2656893) (← links)
- Subsets of posets minimising the number of chains (Q4633778) (← links)
- The number of additive triples in subsets of abelian groups (Q5360385) (← links)
- Set Systems Containing Many Maximal Chains (Q5364237) (← links)
- Sperner's Theorem and a Problem of Erdős, Katona and Kleitman (Q5364244) (← links)
- Families in posets minimizing the number of comparable pairs (Q6134650) (← links)
- Solution to a problem of Katona on counting cliques of weighted graphs (Q6145819) (← links)
- Supersaturation, counting, and randomness in forbidden subposet problems (Q6604693) (← links)
