Geodesic
Barycentric Ramsey Numbers for Small Graphs
Bulletin of the Malaysian Mathematical Society, Tome 32 (2009) no. 1 Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website

Voir la notice de l'article

Let be a finite abelian group of order . The barycentric Ramsey number is the minimum positive integer such that any coloring of the edges of the complete graph by elements of contains a subgraph whose assigned edge color constitutes a barycentric sequence, i.e. there exists one edge whose color is the “average” of the colors of its edges. These are determined for some graphs, in particular for graphs with at most four edges without isolated vertices (i.e. small graphs) and , . Elementary combinatorial arguments are used for these computations.
Classification : 11B50, 11P70, 11B75. 
@article{BMMS_2009_32_1_a0,
     author = {Samuel Gonz\'alez and Leida Gonz\'alez and Oscar Ordaz},
     title = {Barycentric {Ramsey} {Numbers} for {Small} {Graphs}},
     journal = {Bulletin of the Malaysian Mathematical Society},
     year = {2009},
     volume = {32},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/BMMS_2009_32_1_a0/}
}
TY  - JOUR
AU  - Samuel González
AU  - Leida González
AU  - Oscar Ordaz
TI  - Barycentric Ramsey Numbers for Small Graphs
JO  - Bulletin of the Malaysian Mathematical Society
PY  - 2009
VL  - 32
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/BMMS_2009_32_1_a0/
ID  - BMMS_2009_32_1_a0
ER  - 
%0 Journal Article
%A Samuel González
%A Leida González
%A Oscar Ordaz
%T Barycentric Ramsey Numbers for Small Graphs
%J Bulletin of the Malaysian Mathematical Society
%D 2009
%V 32
%N 1
%U http://geodesic.mathdoc.fr/item/BMMS_2009_32_1_a0/
%F BMMS_2009_32_1_a0
Samuel González; Leida González; Oscar Ordaz. Barycentric Ramsey Numbers for Small Graphs. Bulletin of the Malaysian Mathematical Society, Tome 32 (2009) no. 1. http://geodesic.mathdoc.fr/item/BMMS_2009_32_1_a0/