A Ramsey‐type problem and the Turán numbers*
A Ramsey‐type problem and the Turán numbers*
Abstract For each n and k , we examine bounds on the largest number m so that for any k ‐coloring of the edges of K n there exists a copy of K m whose edges receive at most k− 1 colors. We show that for $k \ge \sqrt{n}\;+\,\Omega(n^{1/3})$ , …