Inequalities and Asymptotic Bounds for Ramsey Numbers II.

Abstract

When all pairs of elements of a set are partitioned into two disjoint classes there are determined two graphs. The paper studies the maximal sizes of sets which admit partitions of the pairs of elements into two classes satisfying the conditions of Ramsey's Theorem. (Modified author abstract)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1973
Accession Number
AD0763405

Entities

People

  • James Yackel

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Inequalities

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.