Maximal chains and antichains
From MaRDI portal
Publication:5584558
DOI10.4064/fm-65-2-157-167zbMath0191.00601OpenAlexW802599900MaRDI QIDQ5584558
Publication date: 1969
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/214098
Related Items
On some complexity properties of N-free posets and posets with bounded decomposition diameter, Cutsets of Boolean lattices, N-free posets as generalizations of series-parallel posets, Chains, antichains, and fibres, Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs, Trees as semilattices, A chain decomposition theorem, Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs, Independent sets which meet all longest paths, Concurrency and atomicity, Parallel \(N\)-free order recognition, The asynchronous committee meeting problem, Unconditional reflexive polytopes, Asymptotic enumeration of N-free partial orders, Optimal Linear Extensions by Interchanging Chains, Greedy balanced pairs in \(N\)-free ordered sets, Vertex-transitive CIS graphs, \(N\)-free orders and minimal interval extensions, Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs, Generating boxes from ordered sets and graphs, Minimum cutsets for an element of a Boolean lattice, Compactness and subsets of ordered sets that meet all maximal chains, Antichain cutsets, On the treatment of incomparability in ordering semantics and premise semantics, Bipolar orientations revisited, A companion to Grillet's theorem on maximal chains and antichains, Lattices of crosscuts, On Page Number of N-free Posets, Linear extensions of N-free orders.
