Upper bounds for a Ramsey theorem for trees

DOI10.1007/BF02986688zbMATH Open0849.05052MaRDI QIDQ1343232FDOQ1343232

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

Publication date: 1 February 1995

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

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

zbMATH Keywords

Ramsey theoremRamsey numbercomplete tree

Mathematics Subject Classification ID

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

Cites Work

• Combinatorial partitions of finite posets and lattices - Ramsey lattices
• A Partition Theorem
• Title not available (Why is that?)
• Unavoidable regularities and factor permutations of words
• A Ramsey theorem for trees
• A Partition Theorem for the Infinite Subtrees of a Tree
• Density theorems for finitistic trees
• A generalization of Ramsey's theorem for regular trees
• Chain partitions of ordered sets
• A Ramseyian theorem on products of trees

Cited In (5)

• Upper bounds on number of steals in rooted trees
• Remarks on a Ramsey theory for trees
• Free trees and the optimal bound in Wehrung's theorem
• An upper bound on the Ramsey number of 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)