Pages that link to "Item:Q1239323"
From MaRDI portal
The following pages link to Strong versions of Sperner's theorem (Q1239323):
Displaying 50 items.
- Shortest path poset of Bruhat intervals (Q372833) (← links)
- Construction of 2-factors in the middle layer of the discrete cube (Q444915) (← links)
- Descent sets on 321-avoiding involutions and hook decompositions of partitions (Q458291) (← links)
- Hamiltonian cycles and symmetric chains in Boolean lattices. (Q489325) (← links)
- On switching paths polyhedra (Q579630) (← links)
- Parenthesizations of finite distributive lattices (Q585236) (← links)
- On nested chain decompositions of normalized matching posets of rank 3 (Q634742) (← links)
- Mahonian pairs (Q662027) (← links)
- Matchings and the sum function (Q687124) (← links)
- \(Q _{2}\)-free families in the Boolean lattice (Q766139) (← links)
- Symmetries of statistics on lattice paths between two boundaries (Q895545) (← links)
- Inclusion matrices and chains (Q942174) (← links)
- The necklace poset is a symmetric chain order (Q986102) (← links)
- Methods for nesting rank 3 normalized matching rank-unimodal posets (Q1011490) (← links)
- On the existence of symmetric chain decompositions in a quotient of the Boolean lattice (Q1044888) (← links)
- Vector colorability (Q1100473) (← links)
- Saturated chains of subsets and a random walk (Q1114686) (← links)
- Problems on chain partitions (Q1115891) (← links)
- On chain and antichain families of a partially ordered set (Q1144050) (← links)
- On the lattice of order ideals of an up-down poset (Q1159224) (← links)
- On matroid intersections (Q1166530) (← links)
- Proof of a conjecture on partitions of a Boolean lattice (Q1182036) (← links)
- Some new results on the Littlewood-Offord problem (Q1237733) (← links)
- Recursive matching algorithms and linear orders on the subset lattice (Q1239735) (← links)
- On partitions of a partially ordered set (Q1245831) (← links)
- On strings containing all subsets as substrings (Q1254316) (← links)
- Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group (Q1272363) (← links)
- Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains (Q1317461) (← links)
- A combinatorial decomposition of simplicial complexes (Q1335147) (← links)
- Applications of the symmetric chain decomposition of the lattice of divisors (Q1337572) (← links)
- The order-interval hypergraph of a finite poset and the König property (Q1363653) (← links)
- Nested chain partitions of Hamiltonian filters (Q1380347) (← links)
- Partitioning the Boolean lattice into chains of large minimum size (Q1604571) (← links)
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs (Q1818218) (← links)
- Minimal polynomials for the conjunction of functions on disjoint variables can be very simple (Q1823964) (← links)
- Minimax relations for the partial q-colorings of a graph (Q1825878) (← links)
- Explicit \(\Delta \)-edge-coloring of consecutive levels in a divisor lattice (Q2032907) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains (Q2213816) (← links)
- A simple upper bound on the number of antichains in \([t]^n\) (Q2279682) (← links)
- On orthogonal symmetric chain decompositions (Q2325764) (← links)
- Symmetric chain decompositions of quotients by wreath products. (Q2346474) (← links)
- On a conjecture of Füredi. (Q2349954) (← links)
- Bijections for pairs of non-crossing lattice paths and walks in the plane (Q2349956) (← links)
- Three layer \(Q _{2}\)-free families in the Boolean lattice (Q2376901) (← links)
- The width of downsets (Q2422228) (← links)
- On crown-free families of subsets (Q2452431) (← links)
- Pattern avoidance in compositions and multiset permutations (Q2490028) (← links)
- Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
- On the central levels problem (Q2692785) (← links)
