A canonical partition theorem for trees

  • Vuksanovic V
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper we prove a canonical partition theorem for weakly embedded subtrees of a given regular tree. It was brought to my attention that there is a paper of Milliken "Canonical partition theorem for strongly embedded subtrees of regular trees" circulated in the 1980's. This paper is still unpublished and the results in my paper are discovered independently. Although it is possible to conclude the result about weakly embedded subtrees from Milliken's paper, we give a direct proof which works for both, weakly and strongly embedded subtrees.

Cite

CITATION STYLE

APA

Vuksanovic, V. (2007). A canonical partition theorem for trees. Contributions to Discrete Mathematics, 2(1). https://doi.org/10.55016/ojs/cdm.v2i1.61950

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free