The shift graph and the Ramsey degree of [ N]^
From MaRDI portal
Publication:2453809
Recommendations
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- On the Ramsey multiplicity of complete graphs
- On the Ramsey numbers for complete distance graphs with vertices in \( \{0,1\}^n\)
- On the guessing number of shift graphs
- On the Ramsey-Turán numbers of graphs and hypergraphs
- Ramsey Numbers and the Size of Graphs
- scientific article; zbMATH DE number 3902698
- scientific article; zbMATH DE number 4144029
- Ramsey multiplicities of some graphs
- On size Ramsey numbers of graphs with bounded degree
Cites work
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3532955 (Why is no real title available?)
- scientific article; zbMATH DE number 1302487 (Why is no real title available?)
- A partition calculus in set theory
- Borel chromatic numbers
- Borel partitions of products of finite sets and the Ackermann function
- Borel sets and Ramsey's theorem
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Happy families
- Introduction to Ramsey space
- Partitions of products
- Souslin partitions of products of finite sets
- Topics in topology
Cited in
(3)
This page was built for publication: The shift graph and the Ramsey degree of \([\mathbb N]^\omega\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453809)
