Abstract
An α-greedy balanced pair in an ordered set P=(V,≤) 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 [α,1−α]. We prove that every N-free ordered set which is not totally ordered has a 12-greedy balanced pair.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.