Open AccessAnother view of bipartite Ramsey numbers
Author(s) -
Zhenming Bi,
Gary Chartrand,
Ping Zhang
Publication year - 2018
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2034
Subject(s) - mathematics , bipartite graph , ramsey's theorem , combinatorics , ramsey theory , discrete mathematics , graph
For bipartite graphs F and H and a positive integer s, the s-bipartite Ramsey number BRs(F,H) of F and H is the smallest integer t with t ≥ s such that every red-blue coloring of Ks,t results in a red F or a blue H. We evaluate this number for all positive integers s when F = K2,2 and H ∈ {K2,3,K3,3}.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom