Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

The upper domination Ramsey number u(4,4)

Tomasz DzidoRenata Zakrzewska — 2006

Discussiones Mathematicae Graph Theory

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.

Page 1

Download Results (CSV)