Name
Abstract | ||
|---|---|---|
If each edge of complete graph Kn is colored with one of k colors then it contains a triangle having two colors if k < 1 + n12. The result is best possible when n is the square of a prime. |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1016/0095-8956(78)90056-4 | Journal of Combinatorial Theory, Series B |
DocType | Volume | Issue |
Journal | 24 | 3 |
ISSN | Citations | PageRank |
0095-8956 | 1 | 0.49 |
References | Authors | |
0 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| D.T. Busolini | 1 | 4 | 1.91 |