Abstract
The k-edge-colored bipartite Gallai–Ramsey number bgrk(G:H) is defined as the minimum integer n such that n2≥k and for every N≥n, every edge-coloring (using all k colors) of complete bipartite graph KN,N contains a rainbow copy of G or a monochromatic copy of H. In this paper, we first study the structural theorem on the complete bipartite graph Kn,n with no rainbow copy of K1,3. Next, we utilize the results to prove the exact values of bgrk(P4:H), bgrk(P5:H), bgrk(K1,3:H), where H is a various union of cycles and paths and stars.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
