AbstractFollowing the arrow notation, for a graph G and natural numbers a1,a2,…,ar we write G→(a1,a2,…,ar)v if for every coloring of the vertices of G with r colors there exists a copy of the complete graph Kai of color i for some i=1,2,…,r. We present some constructions of small graphs with this Ramsey property, but not containing large cliques. We also set bounds on the order of the smallest such graphs
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
Let a1 , . . . , ar, be positive integers, i=1 ... r, m = ∑(ai − 1) + 1 and p = max{a1 , . . . , ar...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
AbstractFollowing the arrow notation, for a graph G and natural numbers a1,a2,…,ar we write G→(a1,a2...
AbstractThe vertex Folkman number F(r,n,m), n<m, is the smallest integer t such that there exists a ...
We discuss a branch of Ramsey theory concerning edge Folkman numbers. Fe(3; 3; 4) involves the small...
We discuss a branch of Ramsey theory concerning edge Folkman numbers. Fe(3; 3; 4) involves the small...
Edge Folkman numbers Fe(G1, G2; k) can be viewed as a generalization of more commonly studied Ramsey...
We discuss a branch of Ramsey theory concerning vertex Folkman numbers and how computer algorithms h...
For a graph $G$ and integers $a_i\ge 1$, the expression $G \rightarrow (a_1,\dots,a_r)^v$ means that...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
AbstractWe estimate the minimum possible Ramsey numbers for graphs of given order
For an undirected simple graph $G$, we write $G \rightarrow (H_1, H_2)^v$ if and only if for every r...
We prove that $s_r(K_k) = O(k^5 r^{5/2})$, where $s_r(K_k)$ is the Ramsey parameter introduced by Bu...
Abstract. In 1970, J. Folkman proved that for a given integer r and a graph G of order n there exist...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
Let a1 , . . . , ar, be positive integers, i=1 ... r, m = ∑(ai − 1) + 1 and p = max{a1 , . . . , ar...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
AbstractFollowing the arrow notation, for a graph G and natural numbers a1,a2,…,ar we write G→(a1,a2...
AbstractThe vertex Folkman number F(r,n,m), n<m, is the smallest integer t such that there exists a ...
We discuss a branch of Ramsey theory concerning edge Folkman numbers. Fe(3; 3; 4) involves the small...
We discuss a branch of Ramsey theory concerning edge Folkman numbers. Fe(3; 3; 4) involves the small...
Edge Folkman numbers Fe(G1, G2; k) can be viewed as a generalization of more commonly studied Ramsey...
We discuss a branch of Ramsey theory concerning vertex Folkman numbers and how computer algorithms h...
For a graph $G$ and integers $a_i\ge 1$, the expression $G \rightarrow (a_1,\dots,a_r)^v$ means that...
AbstractIn this paper the following Ramsey–Turán type problem is one of several addressed. For which...
AbstractWe estimate the minimum possible Ramsey numbers for graphs of given order
For an undirected simple graph $G$, we write $G \rightarrow (H_1, H_2)^v$ if and only if for every r...
We prove that $s_r(K_k) = O(k^5 r^{5/2})$, where $s_r(K_k)$ is the Ramsey parameter introduced by Bu...
Abstract. In 1970, J. Folkman proved that for a given integer r and a graph G of order n there exist...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
Let a1 , . . . , ar, be positive integers, i=1 ... r, m = ∑(ai − 1) + 1 and p = max{a1 , . . . , ar...
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by...
DOI
Add to ORKG