A Ramsey Theorem for Indecomposable Matchings

Details A Ramsey Theorem for Indecomposable Matchings A Ramsey Theorem for Indecomposable Matchings

2011-10-14

arxiv.org/abs/1110.3314v2

Mathematics

Combinatorics

2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Ramsey Theorem for Indecomposable Matchings 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 A Ramsey Theorem for Indecomposable Matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Ramsey Theorem for Indecomposable Matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523735