Pages that link to "Item:Q5364244"
From MaRDI portal
The following pages link to Sperner's Theorem and a Problem of Erdős, Katona and Kleitman (Q5364244):
Displayed 22 items.
- A random version of Sperner's theorem (Q458289) (← links)
- On the number of \(K_4\)-saturating edges (Q462935) (← 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)
- A note on supersaturated set systems (Q499460) (← links)
- The minimum number of disjoint pairs in set systems and related problems (Q524186) (← 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)
- A generalization of the independence number (Q2172382) (← links)
- Multicolor chain avoidance in the Boolean lattice (Q2178677) (← links)
- Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
- Structure and supersaturation for intersecting families (Q2420562) (← links)
- Supersaturation, counting, and randomness in forbidden subposet problems (Q2656893) (← links)
- Maximum-size antichains in random set-systems (Q2820272) (← 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)
- On some extremal and probabilistic questions for tree posets (Q6117424) (← 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)
- A short note on supersaturation for oddtown and eventown (Q6157418) (← links)