Maximal chains and antichains

DOI10.4064/FM-65-2-157-167zbMATH Open0191.00601OpenAlexW802599900MaRDI QIDQ5584558FDOQ5584558

Authors: Pierre Antoine Grillet 

Publication date: 1969

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/214098

zbMATH Keywords

ordered sets, lattices

Cited In (29)

• Optimal Linear Extensions by Interchanging Chains
• Greedy balanced pairs in \(N\)-free ordered sets
• Parallel \(N\)-free order recognition
• N-free posets as generalizations of series-parallel posets
• The asynchronous committee meeting problem
• A chain decomposition theorem
• Concurrency and atomicity
• Minimum cutsets for an element of a Boolean lattice
• Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
• Linear extensions of N-free orders.
• Independent sets which meet all longest paths
• On the treatment of incomparability in ordering semantics and premise semantics
• Cutsets of Boolean lattices
• Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs
• A companion to Grillet's theorem on maximal chains and antichains
• Antichain cutsets
• Vertex-transitive CIS graphs
• Compactness and subsets of ordered sets that meet all maximal chains
• Unconditional reflexive polytopes
• On Page Number of N-free Posets
• Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
• Generating boxes from ordered sets and graphs
• Trees as semilattices
• Asymptotic enumeration of N-free partial orders
• \(N\)-free orders and minimal interval extensions
• Lattices of crosscuts
• Bipolar orientations revisited
• Chains, antichains, and fibres
• On some complexity properties of N-free posets and posets with bounded decomposition diameter

This page was built for publication: Maximal chains and antichains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5584558)