Abstract
A balanced pair in an ordered set P = (V, ≤) 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
