A Ramsey Theorem for Indecomposable Matchings
Combinatorics
2011-12-02 v2
Abstract
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.
Cite
@article{arxiv.1110.3314,
title = {A Ramsey Theorem for Indecomposable Matchings},
author = {James Fairbanks},
journal= {arXiv preprint arXiv:1110.3314},
year = {2011}
}
Comments
2 figures