Publication:
On k-Ramsey Numbers of Stripes

0
0

Issued Date

2018

Resource Type

Article

File Type

application/pdf

ISSN

3153681

Other identifier(s)

2-s2.0-85045115558

Rights Holder(s)

Scopus

Bibliographic Citation

Utilitas Mathematica. Vol 106, (2018), p.233-249

Suggested Citation

Andrews E., Bi Z., Johnston D., Lumduanhom C., Zhang P. On k-Ramsey Numbers of Stripes. Utilitas Mathematica. Vol 106, (2018), p.233-249. Retrieved from: https://hdl.handle.net/20.500.14740/6204

Title

On k-Ramsey Numbers of Stripes

Author(s)

Andrews E.
 Bi Z.
 Johnston D.
 Lumduanhom C.
 Zhang P.

Abstract

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.

View online Resources

Research Projects

Organizational Units

Journal Issue

URI

https://hdl.handle.net/20.500.14740/6204

Collections

Scopus: Year 1983-2021

Endorsement

Review

Supplemented By

Referenced By