A bipartite Ramsey number

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1991 English Publisher:Springer Science and Business Media LLCJournal:Graphs and Combinatorics, volume 7, pages 395-396 (issn: 0911-0119, eissn: 1435-5914,

Copyright policy )

Authors: Geoffrey Exoo;

doi: 10.1007/bf01787643

A bipartite Ramsey number

- Summary
- Subjects
- Metrics

Abstract

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\).

Related Organizations

Indiana State University
United States

Keywords

bipartite Ramsey number, incidence graph of a hypergraph, density argument, bipartite graph, Generalized Ramsey theory

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

2

Average

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now