Improving Sharir and Welzl's bound on crossing-free matchings through solving a stronger recurrence

Chenchao You

Sharir and Welzl [1] derived a bound on crossing-free matchings primarily based on solving a recurrence based on the size of the matchings. We show that the recurrence given in Lem…