Abstract
The size Ramsey number ˆ(F1 ,F 2) is the smallest number of edges that an (F1 ,F 2)-arrowing graph can have. Let Si,n be obtained from the star K1,n by subdividing one edge by new i − 1 vertices. Bielak [Periodica Math. Hung. 18
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.
