Abstract
Abstract Let F , G , and H be simple graphs. We say F → ( G , H ) if for every 2-coloring of the edges of F there exists a monochromatic G or H in F . The Ramsey number r ( G , H ) is defined as min {| V ( F )|: F → ( G , H )}, while the restricted size Ramsey number r ∗( G , H ) is defined as min {| E ( F )|: F → ( G , H ), | V ( F ) | = r ( G , H )}. In this paper, we give lower and upper bounds for the restricted size Ramsey number for a path P 3 versus cycles Cn .
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.
