Publication:5888307: Difference between revisions
From MaRDI portal
Publication:5888307
Created automatically from import240305080351 |
(No difference)
|
Latest revision as of 06:05, 7 March 2024
DOI10.1142/S0219061322500180MaRDI QIDQ5888307FDOQ5888307
Publication date: 24 April 2023
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.06660
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Model theory of denumerable and separable structures (03C15) Applications of set theory (03E75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramsey classes of set systems
- Partitions of finite relational and set systems
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- More on the Kechris-Pestov-Todorcevic correspondence: precompact expansions
- A new proof that analytic sets are Ramsey
- Models Without Indiscernibles
- On free actions, minimal flows, and a problem by Ellis
- Borel sets and Ramsey's theorem
- FORCING AND THE HALPERN–LÄUCHLI THEOREM
- Sur l'extension aux relations de quelques propriétés des ordres
- Ramsey theory for product spaces
- Introduction to Ramsey Spaces (AM-174)
- Minimal actions of the group \(\mathbb{S}(\mathbb{Z})\) of permutations of the integers
- Ramsey's Theorem for n-Parameter Sets
- A Partition Theorem
- A Ramsey theorem for trees
- A family of countable homogeneous graphs
- A Partition Theorem for the Infinite Subtrees of a Tree
- Partition properties of the dense local order and a colored version of Milliken's theorem
- Ramsey's theorem for a class of categories
- Canonical partitions of universal structures
- The indivisibility of the homogeneous \(K_ n\)-free graphs
- Edge partitions of the countable triangle free homogeneous graph
- Products of Infinitely Many Perfect Trees
- Coloring subgraphs of the Rado graph
- Counting canonical partitions in the random graph
- Edge partitions of the Rado graph
- Partitions of large Rado graphs
- A partition theorem for a large dense linear order
- Big Ramsey degrees of 3-uniform hypergraphs are finite
- Coloring of universal graphs
- Errata to ``Ramsey's theorem for a class of categories
- A TAIL CONE VERSION OF THE HALPERN–LÄUCHLI THEOREM AT A LARGE CARDINAL
- The Ramsey theory of the universal homogeneous triangle-free graph
- Big Ramsey degrees and topological dynamics
- Big Ramsey Degrees and Divisibility in Classes of Ultrametric Spaces
- THE HALPERN–LÄUCHLI THEOREM AT A MEASURABLE CARDINAL
- Finite big Ramsey degrees in universal structures
- Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees
- On big Ramsey degrees for binary free amalgamation classes
Cited In (6)
- Dual Ramsey properties for classes of algebras
- Forcing with copies of the Rado and Henson graphs
- On big Ramsey degrees for binary free amalgamation classes
- Ramsey theory of homogeneous structures: current trends and open problems
- Title not available (Why is that?)
- Reducts of the Henson graphs with a constant
This page was built for publication: The Ramsey theory of Henson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888307)