Upper bounds for a Ramsey theorem for trees

DOI10.1007/BF02986688zbMath0849.05052MaRDI QIDQ1343232

C. J. Swanepoel, Lou M. Pretorius

Publication date: 1 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Ramsey numbercomplete treeRamsey theorem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Density theorems for finitistic trees
• Combinatorial partitions of finite posets and lattices - Ramsey lattices
• A Ramsey theorem for trees
• A Ramseyian theorem on products of trees
• A generalization of Ramsey's theorem for regular trees
• A Partition Theorem for the Infinite Subtrees of a Tree
• Unavoidable regularities and factor permutations of words
• A Partition Theorem
• Chain partitions of ordered sets