Ramsey Theory on Trees and Applications

DOI10.1007/978-3-662-54069-5_2zbMath1480.03036MaRDI 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

03E35: Consistency and independence results

05C55: Generalized Ramsey theory

05D10: Ramsey theory

03E05: Other combinatorial set theory

03E02: Partition relations

03E40: Other aspects of forcing and Boolean-valued models

Related Items

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

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