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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
