Domination in colored complete graphs

P. Erdős, R. Faudree, A. Gyárfás, R. H. Schelp

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We prove the following conjecture of Erdös and Hajnal: For any fixed positive integer t and for any 2‐coloring of the edges of kn, there exists X ⊂ v(KN) such that |≦| and X monochromatically dominates all but at most n/2t vertices of Kn. In fact, X can be constructed by a fast greedy algorithm.

Original languageEnglish
Pages (from-to)713-718
Number of pages6
JournalJournal of Graph Theory
Volume13
Issue number6
DOIs
Publication statusPublished - 1989

Fingerprint

Colored Graph
Domination
Greedy Algorithm
Complete Graph
Fast Algorithm
Integer

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Domination in colored complete graphs. / Erdős, P.; Faudree, R.; Gyárfás, A.; Schelp, R. H.

In: Journal of Graph Theory, Vol. 13, No. 6, 1989, p. 713-718.

Research output: Contribution to journalArticle

Erdős, P. ; Faudree, R. ; Gyárfás, A. ; Schelp, R. H. / Domination in colored complete graphs. In: Journal of Graph Theory. 1989 ; Vol. 13, No. 6. pp. 713-718.
@article{24093235fc864b51997915c3d52081db,
title = "Domination in colored complete graphs",
abstract = "We prove the following conjecture of Erd{\"o}s and Hajnal: For any fixed positive integer t and for any 2‐coloring of the edges of kn, there exists X ⊂ v(KN) such that |≦| and X monochromatically dominates all but at most n/2t vertices of Kn. In fact, X can be constructed by a fast greedy algorithm.",
author = "P. Erdős and R. Faudree and A. Gy{\'a}rf{\'a}s and Schelp, {R. H.}",
year = "1989",
doi = "10.1002/jgt.3190130607",
language = "English",
volume = "13",
pages = "713--718",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "6",

}

TY - JOUR

T1 - Domination in colored complete graphs

AU - Erdős, P.

AU - Faudree, R.

AU - Gyárfás, A.

AU - Schelp, R. H.

PY - 1989

Y1 - 1989

N2 - We prove the following conjecture of Erdös and Hajnal: For any fixed positive integer t and for any 2‐coloring of the edges of kn, there exists X ⊂ v(KN) such that |≦| and X monochromatically dominates all but at most n/2t vertices of Kn. In fact, X can be constructed by a fast greedy algorithm.

AB - We prove the following conjecture of Erdös and Hajnal: For any fixed positive integer t and for any 2‐coloring of the edges of kn, there exists X ⊂ v(KN) such that |≦| and X monochromatically dominates all but at most n/2t vertices of Kn. In fact, X can be constructed by a fast greedy algorithm.

UR - http://www.scopus.com/inward/record.url?scp=84986534189&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986534189&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190130607

DO - 10.1002/jgt.3190130607

M3 - Article

VL - 13

SP - 713

EP - 718

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 6

ER -