Premium
A class of self‐complementary graphs and lower bounds of some ramsey numbers
Author(s) -
Clapham C. R. J.
Publication year - 1979
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.3190030311
Subject(s) - combinatorics , mathematics , ramsey's theorem , graph , class (philosophy) , discrete mathematics , upper and lower bounds , computer science , mathematical analysis , artificial intelligence
A method is described of constructing a class of self‐complementary graphs, that includes a self‐complementary graph, containing no K 5 , with 41 vertices and a self‐complementary graph, containing no K 7 , with 113 vertices. The latter construction gives the improved Ramsey number lower bound r (7, 7) ≥ 114.
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