AbstractLet n, r, u1, u2,…,uk be positive integers satisfying ui ⩾ r for i = 1,2,…,k. The symbol n → (u1, u2,…,uk)r means that, for any partition of the r-subsets of an n-set S into k classes C1, C2,…,Ck, there is a ui-subset of S all of whose r-subsets belong to Ci for some i, 1 ⩽ i ⩽ k. A theorem of F.P. Ramsey asserts that, if r, u1, u2,…,uk are given, then n → (u1, u2,…,uk)r for all sufficiently large n. n ↦ (u1, u2,…,uk)r denotes the negation of n → (u1, u2,…,uk)r. In this paper a number of results of the form n ↦ (u1, u2,…,uk)3 are obtained
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
AbstractIn this paper, some properties of Ramsey numbers are studied, and the following results are ...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
AbstractPartitions of pairs of elements of a set into classes are considered. The maximal sizes of s...
AbstractSome recurrence inequalities for Ramsey numbers for triples are established by means of expl...
AbstractConsidering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n) is determ...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
AbstractThe symbol n → (u)k means that if the edges of a complete graph on n vertices are colored ar...
AbstractIt is shown that a construction of Hirschfeld, which yields lower bounds for a certain class...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
The partition relation N → (n)^(k)_(ℓ) means that whenever the k-tuples of an N-element set are ℓ-co...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
AbstractIn this paper, some properties of Ramsey numbers are studied, and the following results are ...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
AbstractPartitions of pairs of elements of a set into classes are considered. The maximal sizes of s...
AbstractSome recurrence inequalities for Ramsey numbers for triples are established by means of expl...
AbstractConsidering a known upper bound, the exact value of the Ramsey number r(K2,2,K3,n) is determ...
AbstractIn this note, we prove that R(5, 5; 4)⩾19. We also compute lower bounds for some higher orde...
AbstractThe symbol n → (u)k means that if the edges of a complete graph on n vertices are colored ar...
AbstractIt is shown that a construction of Hirschfeld, which yields lower bounds for a certain class...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
The partition relation N → (n)^(k)_(ℓ) means that whenever the k-tuples of an N-element set are ℓ-co...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
AbstractIn this paper, some properties of Ramsey numbers are studied, and the following results are ...