A canonical partition theorem for uniform families of finite strong subtrees
From MaRDI portal
Publication:400439
DOI10.1016/J.DISC.2014.07.007zbMATH Open1298.05270arXiv1310.3600OpenAlexW2149854469MaRDI QIDQ400439FDOQ400439
Authors: Dimitris Vlitas
Publication date: 21 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Extending a result of K. Milliken cite{Mi2}, in this paper we prove a Ramsey classification result for equivalence relations defined on uniform families of finite strong subtrees of a finite sequence of fixed trees , , that have a finite uniform branching but are of infinite length.
Full work available at URL: https://arxiv.org/abs/1310.3600
Recommendations
Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- A notion of selective ultrafilter corresponding to topological Ramsey spaces
- A Combinatorial Theorem
- Introduction to Ramsey space
- Partition theorems for systems of finite subsets of integers
- Cofinal types of ultrafilters
- A Partition Theorem
- A Ramsey theorem for trees
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: A canonical partition theorem for uniform families of finite strong subtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400439)