A bipartite Ramsey number (Q1180679): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A bipartite Ramsey problem and the Zarankiewicz numbers / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01787643 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020610328 / rank | |||
Normal rank | |||
Latest revision as of 10:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bipartite Ramsey number |
scientific article |
Statements
A bipartite Ramsey number (English)
0 references
27 June 1992
0 references
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\).
0 references
bipartite graph
0 references
density argument
0 references
incidence graph of a hypergraph
0 references
bipartite Ramsey number
0 references
