Ramsey Theory on Trees and Applications
From MaRDI portal
Publication:5224487
DOI10.1007/978-3-662-54069-5_2zbMATH Open1480.03036OpenAlexW2559260973MaRDI QIDQ5224487FDOQ5224487
Authors: Natasha Dobrinen
Publication date: 24 July 2019
Published in: Logic and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54069-5_2
Generalized Ramsey theory (05C55) Partition relations (03E02) Other combinatorial set theory (03E05) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40) Ramsey theory (05D10)
Cites Work
- Introduction to Ramsey space
- A Partition Theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A canonical partition theorem for uniform families of finite strong subtrees
- A family of countable homogeneous graphs
- A Partition Theorem for the Infinite Subtrees of a Tree
- Finite basis for analytic strong \(n\)-gaps
- Canonical partitions of universal structures
- Edge partitions of the countable triangle free homogeneous graph
- Coloring subgraphs of the Rado graph
- Partitions of large Rado graphs
- A partition theorem for a large dense linear order
- A disjoint unions theorem for trees
- Coloring of universal graphs
- Rainbow Ramsey simple structures
- Types in the \(n\)-adic tree and minimal analytic gaps
- The Halpern-Läuchli theorem at a measurable cardinal
Cited In (7)
This page was built for publication: Ramsey Theory on Trees and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224487)