Article

THE IRREDUNDANT RAMSEY NUMBER s(3,6)

Published in: Quaestiones Mathematicae
Volume 13 , issue 2 , 1990 , pages: 141–157

DOI: 10.1080/16073606.1990.9631608

Author(s): R C Brewster Department of Mathematics, CANADA , E J Cockayne Department of Mathematics, CANADA , C M Mynhardt Department of Mathematics, Republic of South Africa

Keywords: 05C55

Download full text Get new issue alerts

Abstract

The irredundant Ramsey number s(m,ń) is the least value of p such that for any p-vertex graph G, either G has an irredundant set of at least n vertices or its complement G has an irredundant set of at least m vertices. The existence of these numbers is guaranteed by Ramsey's theorem. We prove that s(3,6) = 15.

« GENERALISED MAXIMAL INDEPENDENCE PARAMETERS FOR PATHS AND CYCLES

Steiner Numbers in Graphs »