Upper bounds for a Ramsey theorem for trees
From MaRDI portal
Publication:1343232
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
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)
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)