Abstract
For bipartite graphs G1,G2,…,Gk, the bipartite Ramsey number b(G1,G2, …,Gk) is the least positive integer b, so that any coloring of the edges of Kb,b with k colors, will result in a copy of Gi in the ith color, for some i. In this paper we will show that if s is an integer such that s≥max{18,(b(C34,C34)+1)/2}, then b(C2s,P2s)=2s−1.
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.
