New bounds on the Ramsey number \(r ( I_m , L_n )\)
From MaRDI portal
Publication:2222964
DOI10.1016/j.disc.2020.112268zbMath1456.05170arXiv1707.09556OpenAlexW3116829567MaRDI QIDQ2222964
Ferdinand Ihringer, Thilo Weinert, Deepak Rajendraprasad
Publication date: 27 January 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.09556
Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Partition relations for denumerable ordinals
- A note on Ramsey numbers
- On the Ramsey numbers R(3,8) and R(3,9)
- Combinatorial set theory
- On tournaments and their largest transitive subtournaments
- On a problem of Erdős and Rado
- On tournaments free of large transitive subtournaments
- Improvement of a partition theorem of Erdős and Rado
- Some Ramsey nu mbers for directed graphs
- Upper bounds on the size of transitive subtournaments in digraphs
- A partition calculus in set theory
- The Voting Problem
- Independence numbers of locally sparse graphs and a Ramsey type problem
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Partition Relations and Transitivity Domains of Binary Relations
- Disproof of a conjecture of Erdös and moser on tournaments
- On maximal transitive subtournaments
This page was built for publication: New bounds on the Ramsey number \(r ( I_m , L_n )\)
