Geodesic
The upper domination Ramsey number u(4,4)
Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 3, pp. 419-430.

Voir la notice de l'article provenant de la source Library of Science

The upper domination Ramsey number u(m,n) is the smallest integer p such that every 2-coloring of the edges of Kₚ with color red and blue, Γ(B) ≥ m or Γ(R) ≥ n, where B and R is the subgraph of Kₚ induced by blue and red edges, respectively; Γ(G) is the maximum cardinality of a minimal dominating set of a graph G. In this paper, we show that u(4,4) ≤ 15.
Keywords: edge coloring, upper domination Ramsey number 
@article{DMGT_2006_26_3_a6,
     author = {Dzido, Tomasz and Zakrzewska, Renata},
     title = {The upper domination {Ramsey} number u(4,4)},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {419--430},
     publisher = {mathdoc},
     volume = {26},
     number = {3},
     year = {2006},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2006_26_3_a6/}
}
TY  - JOUR
AU  - Dzido, Tomasz
AU  - Zakrzewska, Renata
TI  - The upper domination Ramsey number u(4,4)
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2006
SP  - 419
EP  - 430
VL  - 26
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2006_26_3_a6/
LA  - en
ID  - DMGT_2006_26_3_a6
ER  - 
%0 Journal Article
%A Dzido, Tomasz
%A Zakrzewska, Renata
%T The upper domination Ramsey number u(4,4)
%J Discussiones Mathematicae. Graph Theory
%D 2006
%P 419-430
%V 26
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2006_26_3_a6/
%G en
%F DMGT_2006_26_3_a6
Dzido, Tomasz; Zakrzewska, Renata. The upper domination Ramsey number u(4,4). Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 3, pp. 419-430. http://geodesic.mathdoc.fr/item/DMGT_2006_26_3_a6/

[1] R.C. Brewster, E.J. Cockayne and C.M. Mynhardt, Irredundant Ramsey numbers for graphs, J. Graph Theory 13 (1989) 283-290, doi: 10.1002/jgt.3190130303.

[2] E.J. Cockayne, G. Exoo, J.H. Hattingh and C.M. Mynhardt, The Irredundant Ramsey Number s(4,4), Util. Math. 41 (1992) 119-128.

[3] E.J. Cockayne and S.T. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977) 247-261, doi: 10.1002/net.3230070305.

[4] R.E. Greenwood and A.M. Gleason, Combinatorial relations and chromatic graphs, Canadian J. Math. 7 (1955) 1-7, doi: 10.4153/CJM-1955-001-4.

[5] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of domination in graphs, Marcel Dekker, New York, (1998) (Proposition 3.8, p. 72).

[6] M.A. Henning and O.R. Oellermann, The upper domination Ramsey number u(3,3,3), Discrete Math. 242 (2002) 103-113, doi: 10.1016/S0012-365X(00)00369-1.

[7] M.A. Henning and O.R. Oellermann, On upper domination Ramsey numbers for graphs, Discrete Math. 274 (2004) 125-135, doi: 10.1016/S0012-365X(03)00084-0.