Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/13743
ชื่อเรื่อง: On k-Ramsey Numbers of Stripes
ผู้แต่ง: Andrews E.
Bi Z.
Johnston D.
Lumduanhom C.
Zhang P.
วันที่เผยแพร่: 2018
บทคัดย่อ: For bipartite graphs F and H with Ramsey number R(F, H) = n and an integer k with 2 < k < n, the k-Ramsey number of F and H is the minimum order of a balanced complete k-partite graph G for which every red-blue coloring of G results in a subgraph of G isomorphic to F all of whose edges are colored red or a subgraph isomorphic to H all of whose edges are colored blue. In this work, we investigate the k-Ramsey numbers Rk(F}H) for certain stripes F and H (1-regular graphs) and for certain values of k. We also include a discussion of A:-Ramsey numbers of graphs that are not bipartite. © 2018 Utilitas Mathematica Publishing Inc. All rights reserved.
URI: https://ir.swu.ac.th/jspui/handle/123456789/13743
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045115558&partnerID=40&md5=034f10c8d1c87fb345f8768fef0a636d
ISSN: 3153681
Appears in Collections:Scopus 1983-2021

Files in This Item:
There are no files associated with this item.


Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.