Premium
New lower bounds of some diagonal Ramsey numbers
Author(s) -
Guldan Filip,
Tomasta Pavel
Publication year - 1983
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.3190070118
Subject(s) - ramsey's theorem , mathematics , combinatorics , diagonal , ramsey theory , upper and lower bounds , discrete mathematics , graph , geometry , mathematical analysis
A new construction of self‐complementary graphs containing no K 10 or K 11 is described. This construction gives the Ramsey number lower bounds r (10,10) ≧ 458 and r (11,11) ≧ 542.
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