Abstract
A graph G is said to arrow the graphs F and H , written G → ( F , H ) , if every red-blue coloring of G results in a red F or a blue H . The primary question has been determining graphs G for which G → ( F , H ) . If we consider the version for which F = H , then we can ask a different question: Given a graph G , can we determine all graphs F such that G → ( F , F ) , or simply G → F ? We call this set of graphs the down-arrow Ramsey set of G , or ↓ G . The down-arrow Ramsey set of cycles, paths, and small complete graphs are determined. Graph ideals and graph intersections are introduced and a method for computing down-arrow Ramsey sets is described.
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: Journal of Combinatorial Mathematics and Combinatorial Computing
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.
