Pages that link to "Item:Q4633778"
From MaRDI portal
The following pages link to Subsets of posets minimising the number of chains (Q4633778):
Displaying 18 items.
- Investigating posets via their maximal chains (Q781532) (← links)
- Largest induced suborders satisfying the chain condition (Q1074604) (← links)
- The minimum of the antichains in the factor poset (Q1101454) (← links)
- A lower bound on the size of a complex generated by an antichain (Q1119639) (← links)
- Extreme \(k\)-families (Q1345523) (← 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 shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains (Q1865391) (← links)
- Minimization interchange theorem on posets (Q2069768) (← links)
- The largest projective cube-free subsets of \(\mathbb{Z}_{2^n}\) (Q2323091) (← links)
- Structure and supersaturation for intersecting families (Q2420562) (← links)
- Supersaturation, counting, and randomness in forbidden subposet problems (Q2656893) (← links)
- Minimum weight flat antichains of subsets (Q2665830) (← links)
- INCLUSION THEOREMS FOR SUBSETS (Q3815305) (← links)
- Supersaturation in the Boolean lattice (Q5262057) (← links)
- On disjoint chains of subsets (Q5937251) (← links)
- Families in posets minimizing the number of comparable pairs (Q6134650) (← links)
- Supersaturation, counting, and randomness in forbidden subposet problems (Q6604693) (← links)
