Lexicographic matching in Boolean algebras
From MaRDI portal
Publication:2264666
Cites work
Cited in
(22)- On orthogonal symmetric chain decompositions
- Gröbner bases for complete uniform families
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Boolean layer cakes
- The antipodal layers problem
- Parenthesizations of finite distributive lattices
- Construction of 2-factors in the middle layer of the discrete cube
- A local injective proof of log-concavity for increasing spanning forests
- Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron
- Lexicographic matchings cannot form Hamiltonian cycles
- Gray codes and symmetric chains
- Gray codes and symmetric chains
- Greedy matching in Young's lattice
- On orthogonal symmetric chain decompositions
- The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices
- On 1-factorizations of bipartite Kneser graphs
- On the central levels problem
- Unimodality of differences of specialized Schur functions
- Footnote to a paper of Griggs, Yeh and Grinstead on partitioning into 4- chains
- Some approaches for solving the general (t,k)-design existence problem and other related problems
- The Stanley depth in the upper half of the Koszul complex
- Symmetrische Zerlegung von Kettenprodukten
This page was built for publication: Lexicographic matching in Boolean algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264666)