Un método algoritmo para el cálculo del número baricéntrico de ramsey para el grafo estrella
Let G be an abelian finite group and H be a graph. A sequence in G, with length al least two, is barycentric if it contains an ”average” element of its terms. Within the context of these sequences, one defines the barycentric Ramsey number, denoted by BR(H, G), as the smallest positive integer t suc...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática
2018-04-01
|
| Series: | Boletim da Sociedade Paranaense de Matemática |
| Subjects: | |
| Online Access: | http://periodicos.uem.br/ojs/index.php/BSocParanMat/article/view/30896 |