The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest

DOI10.1007/s11083-018-9469-0zbMath1443.06004arXiv1610.00809OpenAlexW2963994038WikidataQ123150860 ScholiaQ123150860MaRDI QIDQ2314426

Imed Zaguia

Publication date: 22 July 2019

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.00809

zbMATH Keywords

treecover graphlinear extensionbalanced pair1/3-2/3 conjecture(partially) ordered set

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Total orders (06A05)

Related Items (4)

The metric space of limit laws for $q$-hook formulas ⋮ Sorting probability for large Young diagrams ⋮ Greedy balanced pairs in \(N\)-free ordered sets ⋮ Improving the \(\frac{1}{3}\)-\(\frac{2}{3}\) conjecture for width two posets

Cites Work

• The \(1/3\)-\(2/3\) conjecture for \(N\)-free ordered sets
• The gold partition conjecture for 6-thin posets
• On linear extensions of ordered sets with a symmetry
• Balance theorems for height-2 posets
• Balanced pairs in partial orders
• On computing the number of linear extensions of a tree
• Semiorders and the 1/3-2/3 conjecture
• The Information-Theoretic Bound is Good for Merging
• The 1/3–2/3 Conjecture for 5-Thin Posets
• Natural Partial Orders

This page was built for publication: The 1/3-2/3 conjecture for ordered sets whose cover graph is a forest