Collections of Mutually Disjoint Convex Subsets of a Totally Ordered Set
Tyler Clark, Tom Richmond · The Fibonacci Quarterly · 2010
We present a combinatorial proof of an identity for F2n+1 by counting the number of collections of mutually disjoint convex subsets of a totally ordered set of n points. We discuss how the problem is motivated by counting certain topologies on finite sets.