Ramsey Theory on Trees and Applications
From MaRDI portal
Publication:5224487
Cites work
- scientific article; zbMATH DE number 426365 (Why is no real title available?)
- scientific article; zbMATH DE number 3368622 (Why is no real title available?)
- A Partition Theorem
- A Partition Theorem for the Infinite Subtrees of a Tree
- A canonical partition theorem for uniform families of finite strong subtrees
- A disjoint unions theorem for trees
- A family of countable homogeneous graphs
- A partition theorem for a large dense linear order
- Canonical partitions of universal structures
- Coloring of universal graphs
- Coloring subgraphs of the Rado graph
- Edge partitions of the countable triangle free homogeneous graph
- Finite basis for analytic strong \(n\)-gaps
- Introduction to Ramsey space
- Partitions of large Rado graphs
- Rainbow Ramsey simple structures
- The Halpern-Läuchli theorem at a measurable cardinal
- Types in the \(n\)-adic tree and minimal analytic gaps
Cited in
(7)- Local and mean Ramsey numbers for trees
- scientific article; zbMATH DE number 833394 (Why is no real title available?)
- The Halpern-Läuchli theorem at a measurable cardinal
- scientific article; zbMATH DE number 2046383 (Why is no real title available?)
- scientific article; zbMATH DE number 4162920 (Why is no real title available?)
- Alternatives to the Halpern-Läuchli theorem
- Markov Processes and Ramsey Theory for Trees
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)