Abstract

For positive integers , a coloring of is called a -coloring if the edges of every receive at least and at most colors. Let denote the maximum number of colors in a -coloring of . Given we determine the largest such that all -colorings of have at most O(n) colors and we determine asymptotically when it is of order equal to . We give several bounds and constructions.

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 call

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.