Finite trees are Ramsey under topological embeddings

Details Finite trees are Ramsey under topological embeddings Finite trees are Ramsey under topological embeddings

2010-02-08

arxiv.org/abs/1002.1557v1

Mathematics

Combinatorics

8 pages, 1 figure

Scientific paper

We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for every k-coloring of the (topological) copies of P in T there exists a (topological) copy H' of H in T such that all copies of P in H' have the same color. When the trees are represented by the so-called rooted triple relation, the result gives rise to a Ramsey class of relational structures with respect to induced substructures.

Affiliated with

Also associated with

No associations

Rating

Finite trees are Ramsey under topological embeddings 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 Finite trees are Ramsey under topological embeddings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite trees are Ramsey under topological embeddings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307850