Some Generalized Bipartite Ramsey Numbers Involving Short Cycles

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

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 paper, we will consider the bipartite Ramsey number b(C2t1,C2t2,…,C2tk), where ti is an integer and 2 ≤ ti≤ 4 , for all 1 ≤ i≤ k. In particular, we will show that b(C2t1,C2t2,…,C2tk)≤ k(t1+ t2+ ⋯ + tk- k+ 1).

Original languageEnglish
Pages (from-to)433-448
Number of pages16
JournalGraphs and Combinatorics
Volume33
Issue number2
DOIs
Publication statusPublished - 1 Mar 2017

Keywords

  • Bipartite graph
  • Cycle
  • Ramsey

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Some Generalized Bipartite Ramsey Numbers Involving Short Cycles'. Together they form a unique fingerprint.

Cite this