Geodesic
A Ramsey theorem for indecomposable matchings
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/714
Classification : 05C55, 05C70, 06A07
Mots-clés : interleavings, broken nestings, proper pin sequences 
@article{10_37236_714,
     author = {James P. Fairbanks},
     title = {A {Ramsey} theorem for indecomposable matchings},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/714},
     zbl = {1243.05159},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/714/}
}
TY  - JOUR
AU  - James P. Fairbanks
TI  - A Ramsey theorem for indecomposable matchings
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/714/
DO  - 10.37236/714
ID  - 10_37236_714
ER  - 
%0 Journal Article
%A James P. Fairbanks
%T A Ramsey theorem for indecomposable matchings
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/714/
%R 10.37236/714
%F 10_37236_714
James P. Fairbanks. A Ramsey theorem for indecomposable matchings. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/714

Cité par Sources :