AbstractThe following theorem is proved: Let G be a finite graph with cl(G) = m, where cl(G) is the maximum size of a clique in G. Then for any integer r ≥ 1, there is a finite graph H, also with cl(H) = m, such that if the edges of H are r-colored in any way, then H contains an induced subgraph G′ isomorphic to G with all its edges the same color
AbstractFor a graph G let RM(G) be the smallest integer R, if it exists, such that every coloring of...
Abstract Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy o...
For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge ...
AbstractThe following theorem is proved: Let G be a finite graph with cl(G) = m, where cl(G) is the ...
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of ...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of ...
AbstractFor given finite (unordered) graphs G and H, we examine the existence of a Ramsey graph F fo...
AbstractFor given finite (unordered) graphs G and H, we examine the existence of a Ramsey graph F fo...
Abstract. A graph G is r-ramsey-minimal with respect to Kk if every rcolouring of the edges of G yie...
For given finite graphs G and H, when can we assert the existence of a Ramsey graph F with F − → (G)...
Abstract. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G − → H ...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
AbstractFor a graph G let RM(G) be the smallest integer R, if it exists, such that every coloring of...
Abstract Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy o...
For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge ...
AbstractThe following theorem is proved: Let G be a finite graph with cl(G) = m, where cl(G) is the ...
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of ...
AbstractThe Ramsey number of a graph G is the least number t for which it is true that whenever the ...
A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of ...
AbstractFor given finite (unordered) graphs G and H, we examine the existence of a Ramsey graph F fo...
AbstractFor given finite (unordered) graphs G and H, we examine the existence of a Ramsey graph F fo...
Abstract. A graph G is r-ramsey-minimal with respect to Kk if every rcolouring of the edges of G yie...
For given finite graphs G and H, when can we assert the existence of a Ramsey graph F with F − → (G)...
Abstract. For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G − → H ...
For a graph H and an integer n, theTurán number ex(n, H) isthemaximum possible number of edges in a ...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
This BCs thesis deals with topics from graph theory. Ramsey theory in its most basic form deals with...
AbstractFor a graph G let RM(G) be the smallest integer R, if it exists, such that every coloring of...
Abstract Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy o...
For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge ...
DOI
Add to ORKG