Antichain cutsets
From MaRDI portal
Publication:762182
DOI10.1007/BF00383600zbMATH Open0557.06001OpenAlexW4246843255MaRDI QIDQ762182FDOQ762182
Authors: Ivan Rival, Nejib Zaguia
Publication date: 1985
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00383600
Recommendations
finite posetsantichainschainsforbidden substructureslevelsalternating-cover cycleunions of antichain cutsets
Cites Work
Cited In (29)
- Finite cutsets and finite antichains
- A chain decomposition theorem
- Orders with level diagrams
- Minimum cutsets for an element of a Boolean lattice
- On the n-cutset property
- Orbits of antichains in ranked posets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inversions, cuts, and orientations
- The PT-order, minimal cutsets and Menger property
- Chain blockers and convoluted Catalan numbers
- Cutsets of Boolean lattices
- A companion to Grillet's theorem on maximal chains and antichains
- Maximal chains and cutsets of an ordered set: A Menger type approach
- On the dimension of ordered sets with the 2-cutset property
- Diagrams, orientations, and varieties
- The jump number of Z-free ordered sets
- Finite antichain cutsets in posets
- Cycle-free cuts of mutual rank probability relations.
- Antichain cutsets of strongly connected posets
- Obituary: Ivan Rival
- Search and sweep numbers of finite directed acyclic graphs
- Antichain Simplices
- Wide posets with fixed height and cutset number
- The Menger property for infinite ordered sets
- Chaines alternées. (Alternating chains)
- Chains, antichains, and fibres
- Ladders in ordered sets
- A note on operators of deletion and contraction for antichains
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)