A lower bound on the hypergraph Ramsey number R(4,5;3)

Janusz Dybizbański


The 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.
Author Janusz Dybizbański (FMPI / II)
Janusz Dybizbański,,
- Institute of Informatics
Journal seriesContributions to Discrete Mathematics, ISSN 1715-0868, (A 20 pkt)
Issue year2018
Publication size in sheets0.5
Keywords in EnglishRamsey numbers, hypergraph
ASJC Classification2607 Discrete Mathematics and Combinatorics
URL https://cdm.ucalgary.ca/cdm/index.php/cdm/article/download/693/291
Languageen angielski
Score (nominal)20
Score sourcejournalList
ScoreMinisterial score = 20.0, 28-01-2020, ArticleFromJournal
Publication indicators WoS Citations = 0; Scopus SNIP (Source Normalised Impact per Paper): 2018 = 0.371; WoS Impact Factor: 2018 = 0.419 (2) - 2018=0.438 (5)
Citation count*
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?