Contents

Ars Combinatoria

  • Research article

On the Ramsey Number \(R(K_5 – e, K_5 – e) \)

Stanisfaw P.Radziszowski1
1 Department of Computer Science Rochester Institute of Technology Rochester, New York 14623
  • Published: 31/12/1993

Abstract

Using computer algorithms we found that there exists a unique, up to isomorphism, graph on \(21\) points and \(125\) graphs on \(20\) points for the Ramsey number \(R(K_5 – e, K_5 – e) = 22\). We also construct all graphs on \(n\) points for the Ramsey number \(R(K_4 – e, K_5 – e) = 13\) for all \(n \leq 12\).

Citation
Stanisfaw P.Radziszowski. On the Ramsey Number \(R(K_5 – e, K_5 – e) \)[J], Ars Combinatoria, Volume 036. 225-232. .