Name
Abstract | ||
|---|---|---|
In 1959, Goodman [9] determined the minimum number of monochromatic triangles in a complete graph whose edge set is 2-coloured. Goodman (1985) [10] also raised the question of proving analogous results for complete graphs whose edge sets are coloured with more than two colours. In this paper, for n sufficiently large, we determine the minimum number of monochromatic triangles in a 3-coloured copy of K"n. Moreover, we characterise those 3-coloured copies of K"n that contain the minimum number of monochromatic triangles. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jctb.2013.05.002 | J. Comb. Theory, Ser. B |
Keywords | Field | DocType |
three-coloured graph,complete graph,edge set,3-coloured copy,analogous result,monochromatic triangle,minimum number | Complete graph,Discrete mathematics,Graph,Monochromatic color,Combinatorics,Nested triangles graph,Mathematics | Journal |
Volume | Issue | ISSN |
103 | 4 | 0095-8956 |
Citations | PageRank | References |
12 | 0.91 | 10 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Cummings | 1 | 79 | 13.41 |
| Daniel Král' | 2 | 426 | 46.78 |
| Florian Pfender | 3 | 285 | 30.96 |
| Konrad Sperfeld | 4 | 12 | 1.25 |
| Andrew Treglown | 5 | 99 | 15.16 |
| Michael Young | 6 | 49 | 5.07 |