Three-colour bipartite Ramsey number R_b(G₁,G₂,P₃)
From MaRDI portal
Publication:4957982
DOI10.5614/EJGTA.2020.8.1.14zbMATH Open1468.05178OpenAlexW3014437243MaRDI QIDQ4957982FDOQ4957982
Authors: R. Lakshmi, D. G. Sindhu 
Publication date: 6 September 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2020.8.1.14
Recommendations
Cites Work
- Title not available (Why is that?)
- A textbook of graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- A bipartite Ramsey problem and the Zarankiewicz numbers
- Some geometric structures and bounds for Ramsey numbers
- The bipartite Ramsey numbers
- Star-path bipartite Ramsey numbers
- Some bistar bipartite Ramsey numbers
- \(K_{2,2}\)-\(K_{1,n}\) and \(K_{2,n}\)-\(K_{2,n}\) bipartite Ramsey numbers
- Ramsey numbers in complete balanced multipartite graphs. I: Set numbers
- Ramsey numbers in complete balanced multipartite graphs. II: Size numbers
- Star-path and star-stripe bipartite Ramsey numbers in multicoloring
- Bipartite Ramsey numbers involving stars, stripes and trees
- On size multipartite Ramsey numbers for stars versus paths and cycles
- Size multipartite Ramsey numbers for stripes versus small cycles
- Restricted size Ramsey number for path of order three versus graph of order five
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_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\)
- The first nontrivial three color upper domination in Ramsey number is 13
- 3-color bipartite Ramsey number of cycles and paths
- Title not available (Why is that?)
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)
