eprintid: 1529895
rev_number: 19
eprint_status: archive
userid: 608
dir: disk0/01/52/98/95
datestamp: 2017-05-26 14:29:52
lastmod: 2020-02-12 18:14:18
status_changed: 2017-05-26 14:30:00
type: article
metadata_visibility: show
creators_name: Talbot, JM
creators_name: Baber, R
title: A solution to the 2/3 conjecture
ispublished: pub
divisions: UCL
divisions: A01
divisions: B04
divisions: C06
divisions: F59
keywords: Vertex domination, Ramsey theory
note: This version is the version of record. For information on re-use, please refer to the publisher’s terms and conditions.
abstract: 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].
date: 2014-05-22
date_type: published
publisher: Society for Industrial and Applied Mathematics
official_url: http://doi.org/10.1137/130926614
oa_status: green
full_text_type: pub
language: eng
primo: open
primo_central: open_green
article_type_text: Article
verified: verified_manual
elements_id: 1193357
doi: 10.1137/130926614
lyricists_name: Talbot, John
lyricists_id: JMTAL98
actors_name: Talbot, John
actors_name: Laslett, David
actors_id: JMTAL98
actors_id: DLASL34
actors_role: owner
actors_role: impersonator
full_text_status: public
publication: SIAM Journal on Discrete Mathematics
volume: 28
number: 2
pagerange: 756-766
issn: 0895-4801
citation:        Talbot, JM;    Baber, R;      (2014)    A solution to the 2/3 conjecture.                   SIAM Journal on Discrete Mathematics , 28  (2)   pp. 756-766.    10.1137/130926614 <https://doi.org/10.1137/130926614>.       Green open access   
 
document_url: https://discovery.ucl.ac.uk/id/eprint/1529895/1/Talbot_130926614.pdf