Star-path bipartite Ramsey numbers

Johannes H. Hattingh; Michael A. Henning

doi:10.1016/S0012-365X(97)00205-7

Star-path bipartite Ramsey numbers

Johannes H. Hattingh, Michael A. Henning

Research output: Contribution to journal › Article › peer-review

32 Citations (Scopus)

Abstract

For bipartite graphs G₁, G₂...., G_k, the bipartite Ramsey number b(G₁, G₂,...., G_k) is the least positive integer b so that any colouring of the edges of K_b,b with k colours will result in a copy of G_i in the ith colour for some i. In this note, we establish the exact value of the bipartite Ramsey number b(P_m,K_1,n) for all integers m,n,≥2, where P_m denotes a path on m vertices.

Original language	English
Pages (from-to)	255-258
Number of pages	4
Journal	Discrete Mathematics
Volume	185
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(97)00205-7
Publication status	Published - Apr 1998
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0012-365X(97)00205-7

Cite this

@article{e4098a895d7e42c29478b0d55fcdaeb1,

title = "Star-path bipartite Ramsey numbers",

abstract = "For bipartite graphs G1, G2...., Gk, the bipartite Ramsey number b(G1, G2,...., Gk) is the least positive integer b so that any colouring of the edges of Kb,b with k colours will result in a copy of Gi in the ith colour for some i. In this note, we establish the exact value of the bipartite Ramsey number b(Pm,K1,n) for all integers m,n,≥2, where Pm denotes a path on m vertices.",

author = "Hattingh, {Johannes H.} and Henning, {Michael A.}",

year = "1998",

month = apr,

doi = "10.1016/S0012-365X(97)00205-7",

language = "English",

volume = "185",

pages = "255--258",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Star-path bipartite Ramsey numbers

AU - Hattingh, Johannes H.

AU - Henning, Michael A.

PY - 1998/4

Y1 - 1998/4

N2 - For bipartite graphs G1, G2...., Gk, the bipartite Ramsey number b(G1, G2,...., Gk) is the least positive integer b so that any colouring of the edges of Kb,b with k colours will result in a copy of Gi in the ith colour for some i. In this note, we establish the exact value of the bipartite Ramsey number b(Pm,K1,n) for all integers m,n,≥2, where Pm denotes a path on m vertices.

AB - For bipartite graphs G1, G2...., Gk, the bipartite Ramsey number b(G1, G2,...., Gk) is the least positive integer b so that any colouring of the edges of Kb,b with k colours will result in a copy of Gi in the ith colour for some i. In this note, we establish the exact value of the bipartite Ramsey number b(Pm,K1,n) for all integers m,n,≥2, where Pm denotes a path on m vertices.

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

U2 - 10.1016/S0012-365X(97)00205-7

DO - 10.1016/S0012-365X(97)00205-7

M3 - Article

AN - SCOPUS:0041354058

SN - 0012-365X

VL - 185

SP - 255

EP - 258

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

Star-path bipartite Ramsey numbers

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this