Skip to main content
SpringerLink
Log in

A bipartite Ramsey number

  • Research Problems
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We compute the 3-color bipartite Ramsey number ofC 4. This entails a construction which uses the incidence graph of a hypergraph based onK 4.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Irving, R.W. A bipartite Ramsey problem and the Zarankiewicz numbers, Glasgow Math. J.19, 13–26 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Indiana State University, 47809, Terre Haute, IN, USA

    Geoffrey Exoo

Authors
  1. Geoffrey Exoo
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by a grant from the U.S. Office of Naval Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Exoo, G. A bipartite Ramsey number. Graphs and Combinatorics 7, 395–396 (1991). https://doi.org/10.1007/BF01787643

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01787643

Keywords

Search

Navigation