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

Chaya Keller; Micha A. Perles

doi:10.1007/s11856-011-0090-9

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

Chaya Keller, Micha A. Perles

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

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·2^m-1.

Original language	English
Pages (from-to)	465-484
Number of pages	20
Journal	Israel Journal of Mathematics
Volume	187
Issue number	1
DOIs	https://doi.org/10.1007/s11856-011-0090-9
State	Published - 1 Jan 2012
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1007/s11856-011-0090-9

Cite this

@article{1ec29710cd8744f8894801ae6da223d2,

title = "On the smallest sets blocking simple perfect matchings in a convex geometric graph",

abstract = "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·2m-1.",

author = "Chaya Keller and Perles, {Micha A.}",

year = "2012",

month = jan,

day = "1",

doi = "10.1007/s11856-011-0090-9",

language = "English",

volume = "187",

pages = "465--484",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

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

AU - Keller, Chaya

AU - Perles, Micha A.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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·2m-1.

AB - 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·2m-1.

UR - http://www.scopus.com/inward/record.url?scp=84857691675&partnerID=8YFLogxK

U2 - 10.1007/s11856-011-0090-9

DO - 10.1007/s11856-011-0090-9

M3 - Article

AN - SCOPUS:84857691675

SN - 0021-2172

VL - 187

SP - 465

EP - 484

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

IS - 1

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this