IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i7p735-d525981.html
   My bibliography  Save this article

A Note on On-Line Ramsey Numbers for Some Paths

Author

Listed:
  • Tomasz Dzido

    (Institute of Informatics, Faculty of Mathematics, Physics and Informatics, University of Gdańsk, 80-309 Gdańsk, Poland)

  • Renata Zakrzewska

    (Mathematics Teaching and Distance Learning Centre, Gdańsk University of Technology, 80-233 Gdańsk, Poland)

Abstract

We consider the important generalisation of Ramsey numbers, namely on-line Ramsey numbers. It is easiest to understand them by considering a game between two players, a Builder and Painter, on an infinite set of vertices. In each round, the Builder joins two non-adjacent vertices with an edge, and the Painter colors the edge red or blue. An on-line Ramsey number r ˜ ( G , H ) is the minimum number of rounds it takes the Builder to force the Painter to create a red copy of graph G or a blue copy of graph H , assuming that both the Builder and Painter play perfectly. The Painter’s goal is to resist to do so for as long as possible. In this paper, we consider the case where G is a path P 4 and H is a path P 10 or P 11 .

Suggested Citation

  • Tomasz Dzido & Renata Zakrzewska, 2021. "A Note on On-Line Ramsey Numbers for Some Paths," Mathematics, MDPI, vol. 9(7), pages 1-6, March.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:7:p:735-:d:525981
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/7/735/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/7/735/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:7:p:735-:d:525981. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.