Abstract
Abstract Given a positive integer n and a family F of graphs, let R∗(n, F ) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has distinct colors on its edges. We determine R∗(n, T k) where T k is the family of trees with k edges. We derive general bounds for R∗(n, T) where T is an arbitrary tree with k edges. Finally, we present a single tree T with k edges such that R∗(n, T) is nearly as small as R∗(n, T k).
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.
