Abstract
For any graphs F,G, and H, the notation F→(G,H) means that any red-blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. The set R(G,H) consists of all Ramsey (G,H)-minimal graphs, namely all graphs F satisfying F→(G,H) but for each e∈E(F), (F−e)↛(G,H). In this paper, we propose a simple construction for creating new Ramsey minimal graphs from the previous known Ramsey minimal graphs (by subdivision operation). In particular, suppose F∈R(mK2,P4) and let e∈E(F) be an edge contained in a cycle of F, we construct a new Ramsey minimal graph in R((m+1)K2,P4) from graph F by subdividing the edge e four times.
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.
