Balanced pairs in partial orders
From MaRDI portal
Publication:1301727
DOI10.1016/S0012-365X(98)00311-2zbMath0940.06002WikidataQ29039298 ScholiaQ29039298MaRDI QIDQ1301727
Publication date: 12 December 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
survey; partial order; linear extensions; algorithmic aspects; \(\alpha\)-balanced pair; \(1/3-2/3\) conjecture
06A07: Combinatorics of partially ordered sets
Related Items
Counting linear extension majority cycles in partially ordered sets on up to 13 elements, The gold partition conjecture
Cites Work
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Entropy and sorting.
- Proportional transitivity in linear extensions of ordered sets
- A note on merging
- Two poset polytopes
- Computing the number of mergings with constraints
- Linear extensions of infinite posets
- Balancing extensions via Brunn-Minkowski
- On the conductance of order Markov chains
- Counting linear extensions
- Balance theorems for height-2 posets
- How good is the information theory bound in sorting?
- Faster random generation of linear extensions
- Linear extensions of random orders
- A strange pigeon-hole principle
- Semiorders and the 1/3-2/3 conjecture
- Balancing pairs and the cross product conjecture
- Balancing poset extensions
- Partially ordered sets and \(k\)-decomposability
- The Information-Theoretic Bound is Good for Merging
- The 1/3–2/3 Conjecture for 5-Thin Posets
- A Note on Poset Geometries
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
