Pages that link to "Item:Q5966942"
From MaRDI portal
The following pages link to The structure of Sperner k-families (Q5966942):
Displayed 44 items.
- Parenthesizations of finite distributive lattices (Q585236) (← links)
- Some remarks on normalized matching (Q787981) (← links)
- An asymptotic formula for the maximum size of an h-family in products of partially ordered sets (Q801914) (← links)
- A bound for the Dilworth number (Q809096) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Minmax relations for cyclically ordered digraphs (Q885290) (← links)
- Generalized Robinson-Schensted-Knuth correspondence (Q912095) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- A class of matroids derived from saturated chain partitions of partially ordered sets (Q1054739) (← links)
- Networks and chain coverings in partial orders and their products (Q1059648) (← links)
- A new proof of a theorem of Harper on the Sperner-Erdős problem (Q1065006) (← links)
- ``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible (Q1069961) (← links)
- Asymptotics of maximal and typical dimensions of irreducible representations of a symmetric group (Q1075426) (← links)
- Regressions and monotone chains. II: the poset of integer intervals (Q1090686) (← links)
- The Bethe Ansatz and the combinatorics of Young tableaux (Q1100284) (← links)
- On chains and Sperner k-families in ranked posets (Q1139061) (← links)
- On chains and Sperner k-families in ranked posets. II (Q1153108) (← links)
- Extending the Greene-Kleitman theorem to directed graphs (Q1155625) (← links)
- The relation between the height and level characteristics for a matrix with simple singular vertices (Q1173626) (← links)
- The generalized Robinson-Schensted algorithm on the affine Weyl group of type \(A_{n-1}\) (Q1176670) (← links)
- Infinite matching theory (Q1191911) (← links)
- Greene-Kleitman's theorem for infinite posets (Q1207720) (← links)
- Some partitions associated with a partially ordered set (Q1224110) (← links)
- On formal fractions associated with the symmetric groups (Q1229247) (← links)
- The chromatic difference sequence of a graph (Q1246543) (← links)
- Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group (Q1272363) (← links)
- Non-empty cross-2-intersecting families of subsets (Q1319142) (← links)
- Families of sets with locally bounded width (Q1334941) (← links)
- Paths in directed graphs and spectral properties of matrices (Q1344068) (← links)
- Sign types associated to posets (Q1806212) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Extending Greene's theorem to directed graphs (Q1838495) (← links)
- The relation between the Jordan structure of a matrix and its graph (Q2365692) (← links)
- Semistandard tableaux associated with generalized labellings of posets (Q2371073) (← links)
- On Path Partitions and Colourings in Digraphs (Q3655147) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm (Q3708805) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Collections of Subsets with the Sperner Property (Q3944608) (← links)
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices (Q3963037) (← links)
- Dilworth Numbers, Incidence Maps and Product Partial Orders (Q3966187) (← links)
- Semiantichains and Unichain Coverings in Direct Products of Partial Orders (Q3966188) (← links)
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property (Q3967539) (← links)
- On greene's theorem for digraphs (Q4284103) (← links)