Premium
R (4, 5) = 25
Author(s) -
McKay Brendan D.,
Radziszowski Stanislaw P.
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.3190190304
Subject(s) - combinatorics , mathematics , vertex (graph theory) , clique , graph , integer (computer science) , computation , discrete mathematics , order (exchange) , algorithm , computer science , finance , economics , programming language
The Ramsey number R (4, 5) is defined to be the least positive integer n such that every n ‐vertex graph contains either a clique of order 4 or an independent set of order 5. With the help of a long computation using novel techniques, we prove that R (4, 5) = 25. © 1995 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom