A new bound for the 2/3 conjecture

Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni +2

We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one…