A canonical partition theorem for trees
From MaRDI portal
Publication:3558595
zbMATH Open1188.05088MaRDI QIDQ3558595FDOQ3558595
Authors: Vojkan Vuksanovic 
Publication date: 5 May 2010
Recommendations
- A canonical partition theorem for uniform families of finite strong subtrees
- Borel partitions of infinite subtrees of a perfect tree
- Partition relations for partially ordered sets
- Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees
- Canonical equivalence relations on \(\mathbb Q^n\)
Trees (05C05) Generalized Ramsey theory (05C55) Combinatorics of partially ordered sets (06A07) Ramsey theory (05D10)
Cited In (6)
- A canonical partition theorem for uniform families of finite strong subtrees
- Canonical equivalence relations on \(\mathbb Q^n\)
- Dense Subsets of Products of Finite Trees
- Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees
- A proof of a partition theorem for [ℚ]ⁿ
- Partitionability of trees
This page was built for publication: A canonical partition theorem for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558595)
