On the size of maximal chains and the number of pairwise disjoint maximal antichains
From MaRDI portal
Publication:710588
DOI10.1016/J.DISC.2010.06.035zbMATH Open1203.06003OpenAlexW2041190751MaRDI QIDQ710588FDOQ710588
Publication date: 19 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.06.035
Recommendations
Cites Work
- Title not available (Why is that?)
- Partially Ordered Sets
- On the size of maximal antichains and the number of pairwise disjoint maximal chains
- On chain and antichain families of a partially ordered set
- The structure of Sperner k-families
- On retractable sets and the fixed point property
- Long symmetric chains in the Boolean lattice
- Maximal Chains and Antichains in Boolean Lattices
- Title not available (Why is that?)
Cited In (9)
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Size of the largest antichain in a partition poset
- On the size of maximal antichains and the number of pairwise disjoint maximal chains
- Dimension and matchings in comparability and incomparability graphs.
- The size of the largest antichain in the partition lattice
- A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
- Maximum-size antichains in random set-systems
- Counting maximal antichains and independent sets
This page was built for publication: On the size of maximal chains and the number of pairwise disjoint maximal antichains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710588)