On-line Ramsey numbers for paths and stars

J. A. Grytczuk, Henry Kierstead, P. Prałlat

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum,number of rounds (assuming both players play perfectly) is the on-line Ramsey number r̃(H) of the graph H. We determine exact values of r̃(H) for a few short paths and obtain a general upper bound r̃(Pn) ≤ 4n - 7. We also study asymmetric version of this parameter when one of the target graphs is a star Sn with n edges. We prove that r̃(Sn, H) ≤ n · e(H) when H is any tree, cycle or clique.

Original languageEnglish (US)
Pages (from-to)63-74
Number of pages12
JournalDiscrete Mathematics and Theoretical Computer Science
Volume10
Issue number3
StatePublished - 2008

Fingerprint

Ramsey number
Paint
Stars
Star
Path
Graph in graph theory
Clique
Shortest path
Join
Game
Upper bound
Cycle
Target

Keywords

  • Online Ramsey games
  • Size Ramsey number

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science
  • Computer Science(all)

Cite this

On-line Ramsey numbers for paths and stars. / Grytczuk, J. A.; Kierstead, Henry; Prałlat, P.

In: Discrete Mathematics and Theoretical Computer Science, Vol. 10, No. 3, 2008, p. 63-74.

Research output: Contribution to journalArticle

@article{ec40df1845e744efbcda6bd8125ba8c5,
title = "On-line Ramsey numbers for paths and stars",
abstract = "We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum,number of rounds (assuming both players play perfectly) is the on-line Ramsey number r̃(H) of the graph H. We determine exact values of r̃(H) for a few short paths and obtain a general upper bound r̃(Pn) ≤ 4n - 7. We also study asymmetric version of this parameter when one of the target graphs is a star Sn with n edges. We prove that r̃(Sn, H) ≤ n · e(H) when H is any tree, cycle or clique.",
keywords = "Online Ramsey games, Size Ramsey number",
author = "Grytczuk, {J. A.} and Henry Kierstead and P. Prałlat",
year = "2008",
language = "English (US)",
volume = "10",
pages = "63--74",
journal = "Discrete Mathematics and Theoretical Computer Science",
issn = "1365-8050",
publisher = "Maison de l'informatique et des mathematiques discretes",
number = "3",

}

TY - JOUR

T1 - On-line Ramsey numbers for paths and stars

AU - Grytczuk, J. A.

AU - Kierstead, Henry

AU - Prałlat, P.

PY - 2008

Y1 - 2008

N2 - We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum,number of rounds (assuming both players play perfectly) is the on-line Ramsey number r̃(H) of the graph H. We determine exact values of r̃(H) for a few short paths and obtain a general upper bound r̃(Pn) ≤ 4n - 7. We also study asymmetric version of this parameter when one of the target graphs is a star Sn with n edges. We prove that r̃(Sn, H) ≤ n · e(H) when H is any tree, cycle or clique.

AB - We study on-line version of size-Ramsey numbers of graphs defined via a game played between Builder and Painter: in one round Builder joins two vertices by an edge and Painter paints it red or blue. The goal of Builder is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum,number of rounds (assuming both players play perfectly) is the on-line Ramsey number r̃(H) of the graph H. We determine exact values of r̃(H) for a few short paths and obtain a general upper bound r̃(Pn) ≤ 4n - 7. We also study asymmetric version of this parameter when one of the target graphs is a star Sn with n edges. We prove that r̃(Sn, H) ≤ n · e(H) when H is any tree, cycle or clique.

KW - Online Ramsey games

KW - Size Ramsey number

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

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

M3 - Article

AN - SCOPUS:53349178804

VL - 10

SP - 63

EP - 74

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

SN - 1365-8050

IS - 3

ER -