The jump number and the lattice of maximal antichains
From MaRDI portal
Publication:807648
DOI10.1016/0012-365X(91)90016-UzbMATH Open0731.06003OpenAlexW2082567911MaRDI QIDQ807648FDOQ807648
Publication date: 1991
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90016-u
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Linear Extensions by Interchanging Chains
- S-verklebte Summen von Verbänden
- Setup optimization problems with matroid structure
- Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
- Algorithmic Approaches to Setup Minimization
- The Jump Number of Dags and Posets: An Introduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Jump number problem: The role of matroids
- Interval orders without odd crowns are defect optimal
- Title not available (Why is that?)
Cited In (11)
- On-line algorithms for orders
- On the number of maximal antichains in Boolean lattices for \(n\) up to 7
- Title not available (Why is that?)
- Tackling the jump number of interval orders
- Computing on-line the lattice of maximal antichains of posets
- Computational aspects of the 2-dimension of partially ordered sets
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
- \(E=I+T\): the internal extent formula for compacted tries
- \(N\)-free orders and minimal interval extensions
- Simplicial elimination schemes, extremal lattices and maximal antichain lattices
This page was built for publication: The jump number and the lattice of maximal antichains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807648)
