On the smallest sets blocking simple perfect matchings in a convex geometric graph

Details On the smallest sets blocking simple perfect matchings in a convex geometric graph On the smallest sets blocking simple perfect matchings in a convex geometric graph

2009-11-17

arxiv.org/abs/0911.3350v1

Mathematics

Combinatorics

15 pages, 8 figures

Scientific paper

In this paper 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}$.

Affiliated with

Also associated with

No associations

Rating

On the smallest sets blocking simple perfect matchings in a convex geometric graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the smallest sets blocking simple perfect matchings in a convex geometric graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the smallest sets blocking simple perfect matchings in a convex geometric graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650966