The size Ramsey number of a complete bipartite graph

P. Erdos, C. C. Rousseau

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

In this note we prove that the (diagonal) size Ramsey number of Kn.n is bounded below by 1 60n22n.

Original languageEnglish
Pages (from-to)259-262
Number of pages4
JournalDiscrete Mathematics
Volume113
Issue number1-3
DOIs
Publication statusPublished - Apr 5 1993

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'The size Ramsey number of a complete bipartite graph'. Together they form a unique fingerprint.

  • Cite this