is constructed such that every copy of has at least three colors on its edges. As , the number of colors used is . This improves upon the previous probabilistic bound of due to Erdős and Gyárfás.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: March 12, 1998
Rights and permissions
About this article
Cite this article
Mubayi, D. Note – Edge-Coloring Cliques with Three Colors on All 4-Cliques. Combinatorica 18, 293–296 (1998). https://doi.org/10.1007/PL00009822
Issue Date:
DOI: https://doi.org/10.1007/PL00009822