AbstractWe consider monochromatic subragraphs in two-colored graphs as guaranteed by Ramsey's theorem, and ask various questions concerning the degree in the two-colored complete graphs of vertices which are part of these subgraphs
We survey some results on covering the vertices of 2-colored complete graphs by two paths or by two ...
For a graph G, a partiteness k ≥ 2 and a number of colours c, we define the multipartite Ramsey numb...
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appea...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bou...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
Abstract. We prove induced Ramsey theorems in which the induced monochromatic subgraph satisfies tha...
AbstractA natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in la...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of ...
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1...
A natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in large colo...
A natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in large colo...
We survey some results on covering the vertices of 2-colored complete graphs by two paths or by two ...
For a graph G, a partiteness k ≥ 2 and a number of colours c, we define the multipartite Ramsey numb...
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appea...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bou...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
In 1930, Frank Ramsey showed that one will find a monochromatic clique of a specified size in any ed...
Abstract. We prove induced Ramsey theorems in which the induced monochromatic subgraph satisfies tha...
AbstractA natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in la...
The Ramsey number r(G) of a graph G is the smallest number n such that, in any two-colouring of the ...
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of ...
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1...
A natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in large colo...
A natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in large colo...
We survey some results on covering the vertices of 2-colored complete graphs by two paths or by two ...
For a graph G, a partiteness k ≥ 2 and a number of colours c, we define the multipartite Ramsey numb...
For an edge-colored graph, its minimum color degree is defined as the minimum number of colors appea...
DOI
Add to ORKG