On a Generalized Anti-Ramsey Problem

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.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received May 3, 1999

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Axenovich, M., Kündgen, A. On a Generalized Anti-Ramsey Problem. Combinatorica 21, 335–349 (2001). https://doi.org/10.1007/s004930100000

Download citation

  • AMS Subject Classification (2000) Classes:  05C55, 05D40, 05C35