A lower bound on the hypergraph Ramsey number R(4,5;3)
AbstractThe finite version of Ramsey's theorem says that for positive integers r, k, a(1), ... ,a(r), there exists a least number n = R(a(1), ... ,a(r); k) so that if X is an n-element set and all k-subsets of X are r-coloured, then there exists an i and an a(i)-set A so that all k-subsets of A are coloured with the ith colour. In this paper, the bound R(4, 5; 3) >= 35 is shown by using a SAT solver to construct a red-blue colouring of the triples chosen from a 34-element set.
|Journal series||Contributions to Discrete Mathematics, ISSN 1715-0868, (A 20 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||Ramsey numbers, hypergraph|
|Score|| = 20.0, 07-04-2019, ArticleFromJournal|
= 20.0, 07-04-2019, ArticleFromJournal
|Publication indicators||= 0; : 2016 = 0.264; : 2017 = 0.353 (2) - 2017=0.339 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.