Artículo
On the Ramsey numbers for stars versus complete graphs
Autor/es | Boza Prieto, Luis
Cera López, Martín García Vázquez, P. Revuelta Marchena, María Pastora |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2010 |
Fecha de depósito | 2022-09-01 |
Publicado en |
|
Resumen | For graphs G1, . . . , Gs, the multicolor Ramsey number R(G1, . . . , Gs) is the smallest integer r such that if we
give any edge col-oring of the complete graph on r vertices with s colors then there exists a monochromatic
copy ... For graphs G1, . . . , Gs, the multicolor Ramsey number R(G1, . . . , Gs) is the smallest integer r such that if we give any edge col-oring of the complete graph on r vertices with s colors then there exists a monochromatic copy of Gi colored with color i, for some 1 ≤ i ≤ s. In this work the multicolor Ramsey number R(Kp1 , . . . , Kpm , K1,q1 , . . . , K1,qn ) is determined for any set of com-plete graphs and stars in terms of R(Kp1 , . . . , Kpm ) |
Agencias financiadoras | Ministerio de Educación y Ciencia (MEC). España Junta de Andalucía |
Identificador del proyecto | MTM2008-06620-C03-02
P06-FQM-01649 |
Cita | Boza Prieto, L., Cera López, M., García Vázquez, P. y Revuelta Marchena, M.P. (2010). On the Ramsey numbers for stars versus complete graphs. European Journal of Combinatorics, 31 (7), 1680-1688. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
1-s2.0-S0195669810000466-main.pdf | 252.1Kb | [PDF] | Ver/ | |