Abstract
For a given graph H and a positive n , the rainbow number of H , denoted by r b ( n , H ) , is the minimum integer k so that in any edge-coloring of K n with k colors there is a copy of H whose edges have distinct colors. In 2004, Schiermeyer determined r b ( n , k K 2 ) for all n ≥ 3 k + 3 . The case for smaller values of n (namely, n ∈ [ 2 k , 3 k + 2 ] ) remained generally open. In this paper we extend Schiermeyer’s result to all plausible n and hence determine the rainbow number of matchings.
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.
