Let F(n, k) denote the maximum number of two edge colorings of a graph on n vertices that admit no monochromatic Kk, (a complete graph on k vertices). The following results are proved: F(n, 3) = 2[n2/4] for all n ≥ 6. F(n, k) = 2((k-2)/(2k-2)+o(1))n2. In particular, the first result solves a conjecture of Erdös and Rothschild.
|Number of pages||12|
|Journal||Journal of Graph Theory|
|State||Published - Apr 1996|
ASJC Scopus subject areas
- Geometry and Topology