AbstractPartitions of pairs of elements of a set into classes are considered. The maximal sizes of sets which admit partitions of the pairs into classes satisfying the conditions of Ramsey are considered and several inequalities are obtained which relate these maximal sizes for various Ramsey conditions. The principal result concerns the partitions into two classes and the upper bound R(N + 1, N + 1) ⩽ C∗log log Nlog N2NN is obtained
AbstractSome of the counting arguments used by Kalbfleisch in a paper published in the January, 1967...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractPartitions of pairs of elements of a set into classes are considered. The maximal sizes of s...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractLet n, r, u1, u2,…,uk be positive integers satisfying ui ⩾ r for i = 1,2,…,k. The symbol n →...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
AbstractSome recurrence inequalities for Ramsey numbers for triples are established by means of expl...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
AbstractUpper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ⩾ ...
AbstractThis paper gives improved asymptotic lower bounds to the Ramsey function R(k, t). Section 1 ...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
For natural numbers d and t there exists a positive C such that if F is a family of n[superscript C]...
AbstractSome of the counting arguments used by Kalbfleisch in a paper published in the January, 1967...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...
AbstractPartitions of pairs of elements of a set into classes are considered. The maximal sizes of s...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
AbstractWe consider the numbers associated with Ramsey's theorem as it pertains to partitions of the...
AbstractIn this note we obtain new lower bounds for the Ramsey numbers R(5, 5) and R(5, 6). The meth...
AbstractLet n, r, u1, u2,…,uk be positive integers satisfying ui ⩾ r for i = 1,2,…,k. The symbol n →...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
AbstractSome recurrence inequalities for Ramsey numbers for triples are established by means of expl...
AbstractGiven the integers l1, k1, l2, k2, r, which satisfy the condition l1, l2 ⩾ r ⩾ k1, k2 > 0, w...
AbstractUpper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ⩾ ...
AbstractThis paper gives improved asymptotic lower bounds to the Ramsey function R(k, t). Section 1 ...
AbstractIn this note we obtain a new lower bound for the Ramsey number R(5, 6). The method is comput...
For natural numbers d and t there exists a positive C such that if F is a family of n[superscript C]...
AbstractSome of the counting arguments used by Kalbfleisch in a paper published in the January, 1967...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
For two graphs H and G, the Ramsey number r(H, G) is the smallest positive integer n such that every...