Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777366 | European Journal of Combinatorics | 2017 | 23 Pages |
Abstract
Inspired by previous work of Balogh (2006), we show that, given râ¥5 and n large, the balanced complete bipartite graph Knâ2,nâ2 is the n-vertex graph that admits the largest number of r-edge-colorings for which there is no triangle whose edges are assigned three distinct colors. Moreover, we extend this result to lower values of n when râ¥10, and we provide approximate results for râ{3,4}.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Carlos Hoppen, Hanno Lefmann, Knut Odermann,