A bipartite Ramsey number (Q1180679)

From MaRDI portal
Revision as of 13:08, 15 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A bipartite Ramsey number
scientific article

    Statements

    A bipartite Ramsey number (English)
    0 references
    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
    0 references

    Identifiers