Partitioning posets

DOI10.1007/S11083-008-9085-5MaRDI QIDQ943378zbMATH OpenOpenAlexFDO

Authors Viresh Patel

Publication date 9 September 2008

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11083-008-9085-5

zbMATH Keywords

PartitionsPosetsCuts

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07)

Recommendations

• scientific article; zbMATH DE number 67598
• On multipartite posets
• scientific article; zbMATH DE number 219236
• Partitioning a weighted partial order
• Size of the largest antichain in a partition poset

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• A short proof of the existence of k-saturated partitions of partially ordered sets
• Geometric algorithms and combinatorial optimization.
• Judicious partitions and related problems
• Some Extremal Properties of Bipartite Subgraphs
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(10)

• Positroids and non-crossing partitions
• Semi-pointed partition posets
• Two posets of noncrossing set partitions
• scientific article; zbMATH DE number 1305516 (Why is no real title available?)
• scientific article; zbMATH DE number 1506513 (Why is no real title available?)
• Discretized configurations and partial partitions
• The partition method for poset-free families
• Average relational distance in linear extensions of posets
• Edges in the poset of partitions of an integer
• On multipartite posets

This page was built for publication: Partitioning posets

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