id: 06108427
dt: j
an: 06108427
au: Keller, Chaya; Perles, Micha A.
ti: On the smallest sets blocking simple perfect matchings in a convex
    geometric graph.
so: Isr. J. Math. 187, 465-484 (2012).
py: 2012
pu: The Hebrew University Magnes Press, Jerusalem; Springer, Heidelberg
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/s11856-011-0090-9
ab: Summary: We present a complete characterization of the smallest sets which
    block all the simple perfect matchings in a complete convex geometric
    graph on $2m$ vertices. In particular, we show that all these sets are
    caterpillar graphs with a special structure, and that their total
    number is $m \cdot 2^{m-1}$.
rv: