Abstract
Let F , G and H be any simple graphs. The notation F → ( G , H ) means for any red-blue coloring on the edges of graph F , there exists either a red copy of G or a blue copy of H . If F → ( G , H ) , then graph F is called a Ramsey graph for ( G , H ) . Additionally, if the graph F satisfies that F − e ↛ ( G , H ) for any edge e of F , then graph F is called a Ramsey ( G , H ) -minimal. The set of all Ramsey ( G , H ) -minimal graphs is denoted by ℛ( G , H ) . In this paper, we construct a new class of Ramsey ( C 4 , K 1, n ) -minimal graphs.
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 callMore From: Electronic Journal of Graph Theory and Applications
Disclaimer: 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.
