A disjoint union theorem for trees
classification
🧮 math.CO
keywords
treesdisjointleveltheoremuniondevelophales-jewettimplement
read the original abstract
We prove an infinitary disjoint union theorem for level products of trees. To implement the proof we develop a Hales-Jewett type result for words indexed by a level product of trees.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.