1 paper · 1 filter
Pedro M. M. de Castro
A perfect matching in an ordered graph is nonnested if no edge lies strictly inside another. We classify the smallest edge sets meeting every nonnested perfect matching on 2k ord…