Antichain cutsets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3914376 (Why is no real title available?)
- A decomposition theorem for partially ordered sets
- Compact Spaces and Spaces of Maximal Complete Subgraphs
- Finite cutsets and finite antichains
- Graphs indecomposable with respect to the X-join
- Maximal chains and antichains
- The Recognition of Series Parallel Digraphs
Cited in
(29)- Ladders in ordered sets
- On the dimension of ordered sets with the 2-cutset property
- The Menger property for infinite ordered sets
- Minimum cutsets for an element of a Boolean lattice
- On the n-cutset property
- Orbits of antichains in ranked posets
- The PT-order, minimal cutsets and Menger property
- Finite antichain cutsets in posets
- Antichain Simplices
- Antichain cutsets of strongly connected posets
- Chaines alternées. (Alternating chains)
- Cycle-free cuts of mutual rank probability relations.
- Diagrams, orientations, and varieties
- scientific article; zbMATH DE number 4162946 (Why is no real title available?)
- scientific article; zbMATH DE number 4023345 (Why is no real title available?)
- Finite cutsets and finite antichains
- A chain decomposition theorem
- Orders with level diagrams
- A companion to Grillet's theorem on maximal chains and antichains
- A note on operators of deletion and contraction for antichains
- Wide posets with fixed height and cutset number
- Inversions, cuts, and orientations
- Chain blockers and convoluted Catalan numbers
- Obituary: Ivan Rival
- Cutsets of Boolean lattices
- Chains, antichains, and fibres
- Maximal chains and cutsets of an ordered set: A Menger type approach
- Search and sweep numbers of finite directed acyclic graphs
- The jump number of Z-free ordered sets
This page was built for publication: Antichain cutsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762182)
