A Ramsey theorem for indecomposable matchings (Q665747)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Ramsey theorem for indecomposable matchings |
scientific article |
Statements
A Ramsey theorem for indecomposable matchings (English)
0 references
6 March 2012
0 references
Summary: A matching is indecomposable if it does not contain a nontrivial contiguous segment of vertices whose neighbors are entirely contained in the segment. We prove a Ramsey-like result for indecomposable matchings, showing that every sufficiently long indecomposable matching contains a long indecomposable matching of one of three types: interleavings, broken nestings, and proper pin sequences.
0 references
interleavings
0 references
broken nestings
0 references
proper pin sequences
0 references
