Add to ORKGGiven a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring of the edges of K_N contains a monochromatic copy of H. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by the many advances across extremal combinatorics. In this survey, we will describe some of this progress
For s, t, n ∈ N with s ≥ t, an (s, t)-coloring of K$_n$ is an edge coloring of Kn in which each edge...
Given a graph H and an integer r ≥ 2, let G → (H,r) denote the Ramsey property of a graph G, that is...
AbstractSome computer programs used to generate Ramsey edge colorings of graphs are described. New r...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bo...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
AbstractThe Ramsey number r(G) of a graph G is the minimum N such that every red–blue coloring of th...
This MSc thesis deals with a theory, which comes from combinatorics. According to Ramsey's theorem f...
The Ramsey number $R(r, b)$ is the least positive integer such that every edge 2-coloring of the com...
The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains ...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
The Ramsey number r(H) of a graph H is the smallest number n such that, in any two-colouring of the ...
We show that in every two-colouring of the edges of the complete graph K_N there is a monochromatic ...
The Ramsey number r(Ks,Qn) is the smallest positive integer N such that every red–blue colouring of ...
For s, t, n ∈ N with s ≥ t, an (s, t)-coloring of K$_n$ is an edge coloring of Kn in which each edge...
Given a graph H and an integer r ≥ 2, let G → (H,r) denote the Ramsey property of a graph G, that is...
AbstractSome computer programs used to generate Ramsey edge colorings of graphs are described. New r...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bo...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
AbstractThe Ramsey number r(G) of a graph G is the minimum N such that every red–blue coloring of th...
This MSc thesis deals with a theory, which comes from combinatorics. According to Ramsey's theorem f...
The Ramsey number $R(r, b)$ is the least positive integer such that every edge 2-coloring of the com...
The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains ...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
The Ramsey number r(H) of a graph H is the smallest number n such that, in any two-colouring of the ...
We show that in every two-colouring of the edges of the complete graph K_N there is a monochromatic ...
The Ramsey number r(Ks,Qn) is the smallest positive integer N such that every red–blue colouring of ...
For s, t, n ∈ N with s ≥ t, an (s, t)-coloring of K$_n$ is an edge coloring of Kn in which each edge...
Given a graph H and an integer r ≥ 2, let G → (H,r) denote the Ramsey property of a graph G, that is...
AbstractSome computer programs used to generate Ramsey edge colorings of graphs are described. New r...