Ramsey Theory on Trees and Applications

DOI10.1007/978-3-662-54069-5_2zbMath1480.03036OpenAlexW2559260973MaRDI QIDQ5224487

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

Mathematics Subject Classification ID

Consistency and independence results (03E35) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Other combinatorial set theory (03E05) Partition relations (03E02) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (2)

Alternatives to the Halpern-Läuchli theorem ⋮ THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL

Cites Work

• Unnamed Item
• Unnamed Item
• A canonical partition theorem for uniform families of finite strong subtrees
• Partitions of large Rado graphs
• A partition theorem for a large dense linear order
• Canonical partitions of universal structures
• Coloring subgraphs of the Rado graph
• A disjoint unions theorem for trees
• Coloring of universal graphs
• Edge partitions of the countable triangle free homogeneous graph
• Finite basis for analytic strong \(n\)-gaps
• Rainbow Ramsey simple structures
• Introduction to Ramsey Spaces (AM-174)
• A Partition Theorem for the Infinite Subtrees of a Tree
• THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL
• A Partition Theorem
• A family of countable homogeneous graphs
• Types in the \(n\)-adic tree and minimal analytic gaps

This page was built for publication: Ramsey Theory on Trees and Applications