Abstract
Let F, G1 and G2 be simple graphs. Denote by F → (G1, G2) each edge coloring of F by red and blue that contains a red G1 or a blue G2. Define the star-critical Ramsey number RS(G1,G2) to be the largest p such that Kr∖K1,p → (G1, G2), where r=R(G1,G2) is the Ramsey number. By Stability Lemma and Regularity Lemma, we determine RS(C2t+1,K1+nG) and RS(C2t+1,Ks+nK1) for large n.
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.
