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

The Size, Multipartite Ramsey Numbers for nK 2 Versus Path–Path and Cycle

Author

Listed:
  • Yaser Rowshan

    (Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 66731-45137, Iran)

  • Mostafa Gholami

    (Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan 66731-45137, Iran)

  • Stanford Shateyi

    (Department of Mathematics and Applied Mathematics, School of Mathematical and Natural Sciences, University of Venda, P. Bag X5050, Thohoyandou 0950, South Africa)

Abstract

For given graphs G 1 , G 2 , … , G n and any integer j , the size of the multipartite Ramsey number m j ( G 1 , G 2 , … , G n ) is the smallest positive integer t such that any n -coloring of the edges of K j × t contains a monochromatic copy of G i in color i for some i , 1 ≤ i ≤ n , where K j × t denotes the complete multipartite graph having j classes with t vertices per each class. In this paper, we computed the size of the multipartite Ramsey numbers m j ( K 1 , 2 , P 4 , n K 2 ) for any j , n ≥ 2 and m j ( n K 2 , C 7 ) , for any j ≤ 4 and n ≥ 2 .

Suggested Citation

  • Yaser Rowshan & Mostafa Gholami & Stanford Shateyi, 2021. "The Size, Multipartite Ramsey Numbers for nK 2 Versus Path–Path and Cycle," Mathematics, MDPI, vol. 9(7), pages 1-12, April.
  • Handle: RePEc:gam:jmathe:v:9:y:2021:i:7:p:764-:d:528507
    as

    Download full text from publisher

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

    File URL: https://www.mdpi.com/2227-7390/9/7/764/
    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:764-:d:528507. 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.