The upper domination Ramsey number u(3,3,3)
The upper domination number of a graph is the maximal number of vertices in a minimal dominating set. The upper domination Ramsey number \(u(n_1, n_2, \dots, n_k)\) is the smallest integer \(n\) such that for any \(k\)-coloring of the edges of a \(K_n\), the \(i\)th color graph will have upper domination number at least \(n_i\) for some \(i\). It is shown that \(u(3,3,3) = 13\) or \(14\), which verifies that the upper domination Ramsey number \(u(3,3,3)\) is less than the Ramsey number \(r(3,3,3) = 17\), and could possibly equal the irredundant Ramsey number \(s(3,3,3) = 13\).
- An upper bound for the Ramsey numbers \(r(K_ 3,G)\)
- scientific article; zbMATH DE number 4120201
- Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
- The upper domination Ramsey number u(4,4)
- An improved upper bound for Ramsey number R(3,3,3,3;2)
- Upper bounds for the size Ramsey numbers for P₃ versus C^t₃ or P_n
- scientific article; zbMATH DE number 2192105
- The first nontrivial three color upper domination in Ramsey number is 13
- scientific article; zbMATH DE number 867629
- An adaptive upper bound on the Ramsey numbers R(3,,3)
This page was built for publication: The upper domination Ramsey number \(u(3,3,3)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957750)
