A Partition Theorem For Perfect Sets
From MaRDI portal
Publication:3926570
Cites work
Cited in
(30)- Borel conjecture, dual Borel conjecture, and other variants of the Borel conjecture
- On filling families of finite subsets of the Cantor set
- Measures of Graphs on the Reals
- Basis theorems for continuous \(n\)-colorings
- Distinct volume subsets via indiscernibles
- Homogeneity for Open Partitions of Pairs of Reals
- Borel partitions of infinite subtrees of a perfect tree
- Ramsey type theorems for real functions
- Borel conjecture for the Marczewski ideal
- Borel subgroups of Polish groups
- Analytic colorings
- Some partitions of three-dimensional combinatorial cubes
- Potential continuity of colorings
- Choiceless Ramsey theory of linear orders
- Measurable events indexed by words
- On the necessary use of abstract set theory
- Weak Borel chromatic numbers
- Perfect cliques and $G_\delta $ colorings of Polish spaces
- Ramsey families of subtrees of the dyadic tree
- A dual form of Ramsey's theorem
- Infinite combinatorics and definability
- On the consistency of some partition theorems for continuous colorings, and the structure of \(\aleph _ 1\)-dense real order types
- Parametrized Ellentuck theorem
- A collection of topological Ramsey spaces of trees and their application to profinite graph theory
- Canonical Borel equivalence relations on \(\mathbb R^n\)
- Compact subsets of the first Baire class
- Big Ramsey degrees in universal inverse limit structures
- Ultrafilters with property $( {s})$
- A density version of the Halpern-Läuchli theorem
- Unconditional families in Banach spaces
This page was built for publication: A Partition Theorem For Perfect Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3926570)