A Ramseyian theorem on products of trees
From MaRDI portal
Publication:1176379
DOI10.1016/0097-3165(91)90006-3zbMath0753.05078OpenAlexW1967907746MaRDI QIDQ1176379
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(91)90006-3
Related Items (5)
Upper bounds for a Ramsey theorem for trees ⋮ On the structure of random unlabelled acyclic graphs. ⋮ A Ramseyian theorem on products of trees ⋮ Ramsey numbers for partially-ordered sets ⋮ Symmetries and Ramsey properties of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- A Ramsey theoretic problem for finite ordered sets
- A Ramseyian theorem on products of trees
- A generalization of Ramsey's theorem for regular trees
- Partitions of finite relational and set systems
- A partition calculus in set theory
- Global inductive definability
- A Partition Theorem
This page was built for publication: A Ramseyian theorem on products of trees
