2000 character limit reached
A disjoint union theorem for trees
Published 27 Jul 2014 in math.CO | (1407.7292v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.