Pages that link to "Item:Q1865391"
From MaRDI portal
The following pages link to A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains (Q1865391):
Displaying 6 items.
- Investigating posets via their maximal chains (Q781532) (← links)
- Domination analysis for minimum multiprocessor scheduling (Q858313) (← links)
- A lower bound on the size of a complex generated by an antichain (Q1119639) (← links)
- A Meshalkin theorem for projective geometries (Q1395829) (← links)
- Antichains on three levels (Q1883666) (← links)
- A simple upper bound on the number of antichains in \([t]^n\) (Q2279682) (← links)