On the size of maximal antichains and the number of pairwise disjoint maximal chains
From MaRDI portal
Publication:710589
DOI10.1016/J.DISC.2010.06.034zbMATH Open1204.06002OpenAlexW1985940342MaRDI QIDQ710589FDOQ710589
Authors: David M. Howard, William T. Trotter
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.034
Recommendations
Cites Work
Cited In (13)
- On maximum chains in the Bruhat order of \(\mathcal A(n,2)\)
- On the size of maximal chains and the number of pairwise disjoint maximal antichains
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Size of the largest antichain in a partition poset
- Forcing posets with large dimension to contain large standard examples
- Title not available (Why is that?)
- The minimal size of infinite maximal antichains in direct products of partial orders
- Dimension and matchings in comparability and incomparability graphs.
- Two properties of maximal antichains in strict chain product posets
- 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 antichains and the number of pairwise disjoint maximal chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710589)