Greedy balanced pairs in N-free ordered sets

An $\alpha$-greedy balanced pair in an ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of greedy linear extensions of $P$ that put $x$ before $y$ among all greedy linear extensions is in the real interval $[\alpha, \alpha-1]$. We prove that every $N$-free ordered set which is not totally ordered has a $\frac{1}{2}$-greedy balanced pair.

[1]  Michel Habib,et al.  N-free posets as generalizations of series-parallel posets , 1985, Discret. Appl. Math..

[2]  P. A. Grillet Maximal chains and antichains , 1969 .

[3]  Michel Habib,et al.  Nombre de sauts et graphes série-parallèles , 1979, RAIRO Theor. Informatics Appl..

[4]  Charles J. Colbourn,et al.  Minimizing setups in ordered sets of fixed width , 1985 .

[5]  Imed Zaguia The 1/3-2/3 Conjecture for Ordered Sets whose Cover Graph is a Forest , 2019, Order.

[6]  Graham Brightwell Semiorders and the 1/3–2/3 conjecture , 1989 .

[7]  Michel Habib,et al.  The Jump Number of Dags and Posets: An Introduction , 1980 .

[8]  Gerhard Gierz,et al.  Minimizing Setups for Ordered Sets: A Linear Algebraic Approach , 1983 .

[9]  W. Trotter,et al.  The number of depth-first searches of an ordered set , 1989 .

[10]  Marcin Peczarski,et al.  The Gold Partition Conjecture for 6-Thin Posets , 2008, Order.

[11]  Mohamed H. El-Zahar,et al.  Greedy linear extensions to minimize jumps , 1985, Discret. Appl. Math..

[12]  Nathan Linial,et al.  The Information-Theoretic Bound is Good for Merging , 1984, SIAM J. Comput..

[13]  M. El-Zahar,et al.  Asymptotic enumeration ofN-free partial orders , 1989 .

[14]  Imed Zaguia The 1/3-2/3 Conjecture for N-Free Ordered Sets , 2012, Electron. J. Comb..

[15]  Maurice Pouzet,et al.  N-free extensions of posets. Note on a theorem of P.A.Grillet , 2006, Contributions Discret. Math..

[16]  Peter C. Fishburn,et al.  Balance theorems for height-2 posets , 1992 .

[17]  Nejib Zaguia,et al.  Constructing greedy linear extensions by interchanging chains , 1986 .

[18]  Ivan Rival Optimal linear extensions by interchanging chains , 1983 .

[19]  Graham Brightwell,et al.  The 1/3-2/3 Conjecture for 5-Thin Posets , 1992, SIAM J. Discret. Math..

[20]  Ivan Rival,et al.  Linear Ectensions of Finite Ordered Sets , 1984 .

[21]  R. Jegou,et al.  On the greedy dimension of a partial order , 1985 .

[22]  Maciej M. Sysło,et al.  Minimizing the jump number for partially ordered sets: A graph-theoretic approach , 1984 .

[23]  Graham R. Brightwell,et al.  Balanced pairs in partial orders , 1999, Discret. Math..