Some Bistar Bipartite Ramsey Numbers

Johannes H. Hattingh, Ernst J. Joubert

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


For bipartite graphs G 1, G 2,..., G k, the bipartite Ramsey number b(G 1, G 2,..., 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. A tree of diameter three is called a bistar, and will be denoted by B(s, t), where s ≥ 2 and t ≥ 2 are the degrees of the two support vertices. In this paper we will obtain some exact values for b(B(s, t), B(s, t)) and b(B(s, s), B(s, s)). Furtermore, we will show that if k colours are used, with k ≥ 2 and s ≥ 2, then (formula presented.). Finally, we show that for s ≥ 3 and k ≥ 2, the Ramsey number (formula presented.).

Original languageEnglish
Pages (from-to)1175-1181
Number of pages7
JournalGraphs and Combinatorics
Issue number5
Publication statusPublished - Sept 2014


  • Bipartite graph
  • Bistar
  • Ramsey

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Some Bistar Bipartite Ramsey Numbers'. Together they form a unique fingerprint.

Cite this