Results 251 to 260 of about 248,095 (281)
Some of the next articles are maybe not open access.
Combinatorics, Probability and Computing, 2005
The Ramsey Schur number $RS(s,t)$ is the smallest $n$ such that every 2-colouring of the edges of $K_n$ with vertices $1,2,\ldots,n$ contains a green $K_s$ or there are vertices $x_1,x_2,\ldots,x_t$ fulfilling the equation $x_1+x_2+\cdots+x_{t-1}=x_t$ and all edges $(x_i,x_j)$ are red. We prove $RS(3,3)=11, RS(3,t)=t^2-3$ for $t\equiv1\ (\mbox{mod}\ 6)$
Bode, Jens-P. +2 more
openaire +1 more source
The Ramsey Schur number $RS(s,t)$ is the smallest $n$ such that every 2-colouring of the edges of $K_n$ with vertices $1,2,\ldots,n$ contains a green $K_s$ or there are vertices $x_1,x_2,\ldots,x_t$ fulfilling the equation $x_1+x_2+\cdots+x_{t-1}=x_t$ and all edges $(x_i,x_j)$ are red. We prove $RS(3,3)=11, RS(3,t)=t^2-3$ for $t\equiv1\ (\mbox{mod}\ 6)$
Bode, Jens-P. +2 more
openaire +1 more source
Journal of Graph Theory, 1977
AbstractIn previous work, the Ramsey numbers have been evaluated for all pairs of graphs with at most four points. In the present note, Ramsey numbers are tabulated for pairs F1, F2 of graphs where F1 has at most four points and F2 has exactly five points. Exact results are listed for almost all of these pairs.
openaire +2 more sources
AbstractIn previous work, the Ramsey numbers have been evaluated for all pairs of graphs with at most four points. In the present note, Ramsey numbers are tabulated for pairs F1, F2 of graphs where F1 has at most four points and F2 has exactly five points. Exact results are listed for almost all of these pairs.
openaire +2 more sources
Southeast Asian Bulletin of Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Ramsey and Gallai-Ramsey Numbers of Cycles and Books
Acta Mathematicae Applicatae Sinica, English SerieszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei, Mei-qin +3 more
openaire +2 more sources
On the anti-Ramsey number of forests
Discrete Applied Mathematics, 2021Chunqiu Fang, Ervin Győri, Mei Lu
exaly
Gallai–Ramsey number for K5 ${K}_{5}$
Journal of Graph Theory, 2022Colton Magnant, Ingo Schiermeyer
exaly
Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs
Discrete Mathematics, 2022Erfang Shan, Liying Kang
exaly
Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs
Journal of Graph Theory, 2022Yucong Tang
exaly