pith. sign in

arxiv: 1610.00809 · v3 · pith:JGYKX6JLnew · submitted 2016-10-04 · 🧮 math.CO

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

classification 🧮 math.CO
keywords orderedpairgoodconjecturecoverforestgraphbalanced
0
0 comments X
read the original abstract

A balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and claim any ordered set that has a good pair will satisfy the conjecture and furthermore every ordered set which is not totally ordered and has a forest as its cover graph has a good pair.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.