Big Ramsey degrees of 3-uniform hypergraphs are finite
From MaRDI portal
Publication:2678449
DOI10.1007/s00493-021-4664-9OpenAlexW4213229643MaRDI QIDQ2678449
Jan Hubička, Lluís Vena, Matěj Konečný, Martin Balko, David Chodounský
Publication date: 23 January 2023
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.00268
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Ramsey theory (05D10)
Related Items (4)
The Ramsey theory of Henson graphs ⋮ Ramsey theory of homogeneous structures: current trends and open problems ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Big Ramsey degrees in universal inverse limit structures
Cites Work
- Unnamed Item
- Unnamed Item
- Partition properties of the dense local order and a colored version of Milliken's theorem
- Canonical partitions of universal structures
- Coloring subgraphs of the Rado graph
- Ramsey degrees of finite ultrametric spaces, ultrametric Urysohn spaces and dynamics of their isometry groups
- A Ramsey theorem for trees
- Big Ramsey degrees and topological dynamics
- Finite big Ramsey degrees in universal structures
- A survey of homogeneous structures
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Rainbow Ramsey simple structures
- Ramsey Theory for Product Spaces
- Introduction to Ramsey Spaces (AM-174)
- Products of Infinitely Many Perfect Trees
- Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees
- The Ramsey theory of the universal homogeneous triangle-free graph
This page was built for publication: Big Ramsey degrees of 3-uniform hypergraphs are finite