Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 441-452 |
| Number of pages | 12 |
| Journal | Journal of Graph Theory |
| Volume | 21 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 1996 |
| Externally published | Yes |
ASJC Scopus subject areas
- Geometry and Topology