Upper bounds for a Ramsey theorem for trees

DOI10.1007/BF02986688MaRDI QIDQ1343232zbMATH OpenFDO

Authors C. J. Swanepoel, L. M. Pretorius

Publication date 1 February 1995

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

zbMATH Keywords

Ramsey theoremRamsey numbercomplete tree

Mathematics Subject Classification ID

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

Recommendations

• An upper bound on the Ramsey number of trees
• On generalized Ramsey numbers for trees
• scientific article; zbMATH DE number 1080084
• Remarks on a Ramsey theory for trees
• An Upper Bound for Constrained Ramsey Numbers

Cites work

• scientific article; zbMATH DE number 3470438 (Why is no real title available?)
• A Partition Theorem
• A Partition Theorem for the Infinite Subtrees of a Tree
• A Ramsey theorem for trees
• A Ramseyian theorem on products of trees
• A generalization of Ramsey's theorem for regular trees
• Chain partitions of ordered sets
• Combinatorial partitions of finite posets and lattices - Ramsey lattices
• Density theorems for finitistic trees
• Unavoidable regularities and factor permutations of words

Cited in

(5)

• An upper bound on the Ramsey number of trees
• Free trees and the optimal bound in Wehrung's theorem
• Remarks on a Ramsey theory for trees
• Upper bounds on number of steals in rooted trees
• A Ramseyian theorem on products of trees

This page was built for publication: Upper bounds for a Ramsey theorem for trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343232)