A bipartite Ramsey number
type: Item
instance of: scholarly article
title: A bipartite Ramsey number
zbMATH Open document ID: 0738.05061
DOI: 10.1007/BF01787643
author: Geoffrey Exoo
published in: Graphs and Combinatorics
publication date: 1992-06-27T00:00:00Z
review text: Denote by \(br(G;k)\) the \(k\)-color bipartite Ramsey number of a bipartite graph \(G\), i.e. the minimum integer \(n\) such that in any \(k\)-coloring of the edges of \(K_{n,n}\) there is a monochromatic subgraph isomorphic to \(G\). In this note the author proved that \(br(C_ 4;3)=11\).
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 26291
zbMATH Keywords: bipartite graph
zbMATH Keywords: density argument
zbMATH Keywords: incidence graph of a hypergraph
zbMATH Keywords: bipartite Ramsey number
reviewed by: Jiahai Kan
MaRDI profile type: Publication
cites work: A bipartite Ramsey problem and the Zarankiewicz numbers
full work available at URL: https://doi.org/10.1007/bf01787643
OpenAlex ID: W2020610328
description: scientific article; zbMATH DE number 26291