AbstractBoza et al. [L. Boza, M. Cera, P. García-Vázquez, M.P. Revuelta, On the Ramsey numbers for stars versus complete graphs, European J. Combin. 31 (2010) 1680–1688] gave the exact value of the multicolor Ramsey number R(K1,q1,…,K1,qn,Kp1,…,Kpm) in terms of R(Kp1,…,Kpm). In this note, we give a short proof of this result
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no ...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
AbstractBoza et al. [L. Boza, M. Cera, P. García-Vázquez, M.P. Revuelta, On the Ramsey numbers for s...
AbstractFor graphs G1,…,Gs, the multicolor Ramsey number R(G1,…,Gs) is the smallest integer r such t...
For a graph $H$ and integer $k\ge1$, let $r(H;k)$ and $r_\ell(H;k)$ denote the $k$-color Ramsey numb...
AbstractIn 1929, Ramsey proved a theorem guaranteeing that if G1,G2,…,Gk are graphs, then there exis...
AbstractThe Ramsey numbers r(mKp,n1P2,…, ndP2), p>2, are calculated for d<p and nj⩾m for each j
The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains ...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
AbstractFor two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p su...
AbstractThe generalised Ramsey number R(G1, G2,..., Gk) is defined as the smallest integer n such th...
Ramsey theory is a eld of study named after the mathematician Frank P. Ramsey. In general, problems ...
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no ...
AbstractWe calculate some size Ramsey numbers involving stars. For example we prove that for t ⩾ k ⩾...
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no ...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
AbstractBoza et al. [L. Boza, M. Cera, P. García-Vázquez, M.P. Revuelta, On the Ramsey numbers for s...
AbstractFor graphs G1,…,Gs, the multicolor Ramsey number R(G1,…,Gs) is the smallest integer r such t...
For a graph $H$ and integer $k\ge1$, let $r(H;k)$ and $r_\ell(H;k)$ denote the $k$-color Ramsey numb...
AbstractIn 1929, Ramsey proved a theorem guaranteeing that if G1,G2,…,Gk are graphs, then there exis...
AbstractThe Ramsey numbers r(mKp,n1P2,…, ndP2), p>2, are calculated for d<p and nj⩾m for each j
The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains ...
AbstractThis note evaluates the Ramsey numbers r(Pm,Kn), and discusses developments in 0 generalized...
AbstractFor two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p su...
AbstractThe generalised Ramsey number R(G1, G2,..., Gk) is defined as the smallest integer n such th...
Ramsey theory is a eld of study named after the mathematician Frank P. Ramsey. In general, problems ...
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no ...
AbstractWe calculate some size Ramsey numbers involving stars. For example we prove that for t ⩾ k ⩾...
The core idea of Ramsey theory is that complete disorder is impossible. Given a large structure, no ...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring...
DOI
Add to ORKG