Pages that link to "Item:Q1119639"
From MaRDI portal
The following pages link to A lower bound on the size of a complex generated by an antichain (Q1119639):
Displaying 12 items.
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes (Q1025547) (← links)
- On cross-intersecting families (Q1201261) (← links)
- The convex hull of antichains in posets (Q1204518) (← links)
- A shorter, simpler, stronger proof of the Meshalkin--Hochberg--Hirsch bounds on componentwise antichains (Q1865391) (← links)
- New results on edge-bandwidth (Q1885045) (← links)
- Extremal set theory for the binomial norm (Q2010646) (← links)
- Stability for vertex isoperimetry in the cube (Q2200919) (← links)
- Flattening antichains (Q2495695) (← links)
- On Sums of Generating Sets in ℤ<sub>2</sub><sup><i>n</i></sup> (Q3168448) (← links)
- Reverse Kleitman Inequalities (Q3827176) (← links)
- On diagnosability of large multiprocessor networks (Q5901447) (← links)