Premium
The ramsey number r ( k 1 + c 4 , k 5 − e )
Author(s) -
Yuansheng Yang,
Hendry G. R. T.
Publication year - 1995
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.3190190103
Subject(s) - combinatorics , ramsey's theorem , mathematics , graph , discrete mathematics
The graph K 5 ‐ e is obtained from the complete graph K 5 by deleting one edge, while K 1 + C 4 is obtained from K 5 by deleting two independent edges. With the help of a computer it is shown that r ( K 1 + C 4 , K 5 ‐ e ) = 17. © 1995 John Wiley & Sons, Inc.