The first nontrivial three color upper domination in Ramsey number is 13
From MaRDI portal
Publication:2839738
zbMATH Open1270.05067MaRDI QIDQ2839738FDOQ2839738
Authors: Changming Su, Fangnian Lang, Zehui Shao
Publication date: 12 July 2013
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Recommendations
- The upper domination Ramsey number \(u(3,3,3)\)
- On some three-color Ramsey numbers
- Three-color Ramsey numbers for paths
- Three-colour bipartite Ramsey number \(R_b(G_1,G_2,P_3)\)
- On some three-color Ramsey numbers for paths
- On three color Ramsey numbers \(R(C_4, C_4, K_{1, n})\)
- The 3-colour Ramsey number of a 3-uniform Berge cycle
- On three-color Ramsey numbers \(R(C_{4},K_{1,m},P_{n})\)
- On three-color Ramsey number of paths
- Three color Ramsey numbers for graphs with at most 4 vertices
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Generalized Ramsey theory (05C55)
Cited In (2)
This page was built for publication: The first nontrivial three color upper domination in Ramsey number is 13
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839738)