AbstractThis paper gives improved asymptotic lower bounds to the Ramsey function R(k, t). Section 1 considers the symmetric case k = t while the more general case is considered in Section 2
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
Ramsey’s theorem, in the version of Erdős and Szekeres, states that every 2-coloring of the edges of...
AbstractA probability theorem, due to Lovasz, is used to derive lower bounds for various Ramsey func...
AbstractThis paper gives improved asymptotic lower bounds to the Ramsey function R(k, t). Section 1 ...
AbstractUpper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ⩾ ...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
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...
The Hales-Jewett theorem is one of the pillars of Ramsey theory, from which many other results follo...
In this paper we introduce a general framework for proving lower bounds for various Ramsey type prob...
We study two problems in graph Ramsey theory. In the early 1970's, Erd\H{o}s and O'Neil considered a...
We divide our attention between two open problems. One of them is to find better lower bounds on Ram...
AbstractSome of the counting arguments used by Kalbfleisch in a paper published in the January, 1967...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
Ramsey’s theorem, in the version of Erdős and Szekeres, states that every 2-coloring of the edges of...
AbstractA probability theorem, due to Lovasz, is used to derive lower bounds for various Ramsey func...
AbstractThis paper gives improved asymptotic lower bounds to the Ramsey function R(k, t). Section 1 ...
AbstractUpper bounds are found for the Ramsey function. We prove R(3, x) < cx2lnx and, for each k ⩾ ...
We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed numbe...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
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...
The Hales-Jewett theorem is one of the pillars of Ramsey theory, from which many other results follo...
In this paper we introduce a general framework for proving lower bounds for various Ramsey type prob...
We study two problems in graph Ramsey theory. In the early 1970's, Erd\H{o}s and O'Neil considered a...
We divide our attention between two open problems. One of them is to find better lower bounds on Ram...
AbstractSome of the counting arguments used by Kalbfleisch in a paper published in the January, 1967...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numb...
Ramsey’s theorem, in the version of Erdős and Szekeres, states that every 2-coloring of the edges of...
DOI
Add to ORKG