Ramsey numbers for tournaments

Yannis Manoussakis, Z. Tuza

Research output: Contribution to journalArticle

Abstract

The Ramsey number r(D1,...,Dk) of acyclic directed graphs D1,...,Dk is defined as the largest integer r for which there exists a tournament T = (V,A) on r vertices with a k-coloring φ:A → {1,...,k} of the arc set A such that no Di occurs in color i for any i ∈ {1,...,k}. We discuss recursive techniques to compute r(D1,...,Dk) in the case where there are paths and/or stars among the Di. In particular, solving a problem of Bialostocki and Dierker [Congr. Numer. 47 (1985) 119-123], we prove that r(D1,D2)=r(D1)·r(D2) holds if D1 is transitive and D2 = Sn is an out-going star on n vertices. Our main result is an asymptotic formula for r(D1,...,Dk,Sn) where the digraphs D1,...,Dk are fixed arbitrarily and n → ∞.

Original languageEnglish
Pages (from-to)75-85
Number of pages11
JournalTheoretical Computer Science
Volume263
Issue number1-2
DOIs
Publication statusPublished - 2001

Fingerprint

Ramsey number
Tournament
Stars
Star
Directed Acyclic Graph
Directed graphs
Coloring
Asymptotic Formula
Digraph
Colouring
Arc of a curve
Color
Path
Integer

Keywords

  • Ramsey number
  • Tournament

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Ramsey numbers for tournaments. / Manoussakis, Yannis; Tuza, Z.

In: Theoretical Computer Science, Vol. 263, No. 1-2, 2001, p. 75-85.

Research output: Contribution to journalArticle

Manoussakis, Yannis ; Tuza, Z. / Ramsey numbers for tournaments. In: Theoretical Computer Science. 2001 ; Vol. 263, No. 1-2. pp. 75-85.
@article{8331e6e42962429483fd071c730042bb,
title = "Ramsey numbers for tournaments",
abstract = "The Ramsey number r(D1,...,Dk) of acyclic directed graphs D1,...,Dk is defined as the largest integer r for which there exists a tournament T = (V,A) on r vertices with a k-coloring φ:A → {1,...,k} of the arc set A such that no Di occurs in color i for any i ∈ {1,...,k}. We discuss recursive techniques to compute r(D1,...,Dk) in the case where there are paths and/or stars among the Di. In particular, solving a problem of Bialostocki and Dierker [Congr. Numer. 47 (1985) 119-123], we prove that r(D1,D2)=r(D1)·r(D2) holds if D1 is transitive and D2 = Sn is an out-going star on n vertices. Our main result is an asymptotic formula for r(D1,...,Dk,Sn) where the digraphs D1,...,Dk are fixed arbitrarily and n → ∞.",
keywords = "Ramsey number, Tournament",
author = "Yannis Manoussakis and Z. Tuza",
year = "2001",
doi = "10.1016/S0304-3975(00)00232-2",
language = "English",
volume = "263",
pages = "75--85",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Ramsey numbers for tournaments

AU - Manoussakis, Yannis

AU - Tuza, Z.

PY - 2001

Y1 - 2001

N2 - The Ramsey number r(D1,...,Dk) of acyclic directed graphs D1,...,Dk is defined as the largest integer r for which there exists a tournament T = (V,A) on r vertices with a k-coloring φ:A → {1,...,k} of the arc set A such that no Di occurs in color i for any i ∈ {1,...,k}. We discuss recursive techniques to compute r(D1,...,Dk) in the case where there are paths and/or stars among the Di. In particular, solving a problem of Bialostocki and Dierker [Congr. Numer. 47 (1985) 119-123], we prove that r(D1,D2)=r(D1)·r(D2) holds if D1 is transitive and D2 = Sn is an out-going star on n vertices. Our main result is an asymptotic formula for r(D1,...,Dk,Sn) where the digraphs D1,...,Dk are fixed arbitrarily and n → ∞.

AB - The Ramsey number r(D1,...,Dk) of acyclic directed graphs D1,...,Dk is defined as the largest integer r for which there exists a tournament T = (V,A) on r vertices with a k-coloring φ:A → {1,...,k} of the arc set A such that no Di occurs in color i for any i ∈ {1,...,k}. We discuss recursive techniques to compute r(D1,...,Dk) in the case where there are paths and/or stars among the Di. In particular, solving a problem of Bialostocki and Dierker [Congr. Numer. 47 (1985) 119-123], we prove that r(D1,D2)=r(D1)·r(D2) holds if D1 is transitive and D2 = Sn is an out-going star on n vertices. Our main result is an asymptotic formula for r(D1,...,Dk,Sn) where the digraphs D1,...,Dk are fixed arbitrarily and n → ∞.

KW - Ramsey number

KW - Tournament

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

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

U2 - 10.1016/S0304-3975(00)00232-2

DO - 10.1016/S0304-3975(00)00232-2

M3 - Article

VL - 263

SP - 75

EP - 85

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -