Premium
An upper bound for the ramsey number r(K 5 − e)
Author(s) -
Harborth H.,
Mengersen I.
Publication year - 1985
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190090408
Subject(s) - ramsey's theorem , mathematics , combinatorics , upper and lower bounds , ramsey theory , discrete mathematics , graph , mathematical analysis
An upper bound of 23 is proved for the Ramsey number r(K 5 − e).