Three-colour bipartite Ramsey number R_b(G₁,G₂,P₃)
From MaRDI portal
Publication:4957982
Recommendations
Cites work
- scientific article; zbMATH DE number 1186105 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3520445 (Why is no real title available?)
- A bipartite Ramsey problem and the Zarankiewicz numbers
- A textbook of graph theory
- Bipartite Ramsey numbers involving stars, stripes and trees
- On size multipartite Ramsey numbers for stars versus paths and cycles
- Ramsey numbers in complete balanced multipartite graphs. I: Set numbers
- Ramsey numbers in complete balanced multipartite graphs. II: Size numbers
- Restricted size Ramsey number for path of order three versus graph of order five
- Size multipartite Ramsey numbers for stripes versus small cycles
- Some bistar bipartite Ramsey numbers
- Some geometric structures and bounds for Ramsey numbers
- Star-path and star-stripe bipartite Ramsey numbers in multicoloring
- Star-path bipartite Ramsey numbers
- The bipartite Ramsey numbers
- \(K_{2,2}\)-\(K_{1,n}\) and \(K_{2,n}\)-\(K_{2,n}\) bipartite Ramsey numbers
Cited in
(7)- Gallai-Ramsey Number for Rainbow S3
- The bipartite Ramsey numbers \(\operatorname{BR}(C_8, C_{2n})\)
- Multipartite Ramsey number of complete graphs versus matchings
- Some three-color Ramsey numbers, R(P₄,P₅,C_k) and R(P₄,P₆,C_k)
- The first nontrivial three color upper domination in Ramsey number is 13
- 3-color bipartite Ramsey number of cycles and paths
- scientific article; zbMATH DE number 6161608 (Why is no real title available?)
This page was built for publication: Three-colour bipartite Ramsey number \(R_b(G_1,G_2,P_3)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957982)