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