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