Name
Abstract | ||
|---|---|---|
The largest number n = n(k) for which there exists a k-coloring of the edges of kn with every triangle 2-colored is found to be n(k) = 2r5m, where k = 2m + r and r = 0 or 1, and all such colorings are given. We also prove the best possible result that a k-colored Kp satisfying 1 < k < 1 + √p contains at most k − 2 vertices not in a bichromatic triangle. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1016/0095-8956(81)90053-8 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
complete graph,edge coloring | Discrete mathematics,Graph,Colored,Combinatorics,Vertex (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
30 | 3 | 0095-8956 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| D.T. Busolini | 1 | 4 | 1.91 |