Ramsey's theorem-A new lower bound

Research output: Contribution to journalArticle

Abstract

This paper gives improved asymptotic lower bounds to the Ramsey function R(k, t). Section 1 considers the symmetric case k = t while the more general case is considered in Section 2.

Original languageEnglish (US)
Pages (from-to)108-115
Number of pages8
JournalJournal of Combinatorial Theory, Series A
Volume18
Issue number1
DOIs
StatePublished - Jan 1975

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this