TY  - JOUR
VL  - 28
SP  - 756
A1  - Talbot, JM
A1  - Baber, R
PB  - Society for Industrial and Applied Mathematics
JF  - SIAM Journal on Discrete Mathematics
Y1  - 2014/05/22/
N2  - We prove a vertex domination conjecture of Erd?os, Faudree, Gould, Gy´arf´as,
Rousseau, and Schelp that for every n-vertex complete graph with edges colored using three colors
there exists a set of at most three vertices which have at least 2n/3 neighbors in one of the colors.
Our proof makes extensive use of the ideas presented in [D. Kr´al? et al., A new bound for the 2/3
conjecture, Combin. Probab. Comput. 22 (2013), pp. 384?393].
ID  - discovery1529895
UR  - http://doi.org/10.1137/130926614
N1  - This version is the version of record. For information on re-use, please refer to the publisher?s terms and conditions.
KW  - Vertex domination
KW  -  Ramsey theory
SN  - 0895-4801
TI  - A solution to the 2/3 conjecture
AV  - public
IS  - 2
EP  - 766
ER  -