## Some small ramsey numbers

- M. Clancy
- Journal of Graph Theory
- 1977

c n (F ) = | V (F ) | and e (F ) = | E (F ) | . The graph F denotes the complement of F . A graph F will be alled a (G , H )−good graph, if F does not contain G and F does not contain H . Any (G , H )-good s t graph on n vertices will be called a (G , H , n )−good graph. The Ramsey number R (G , H ) is defined a he smallest integer n such that no (G , H… (More)

@inproceedings{Radziszowski2007PathsCA,
title={Paths, Cycles and Wheels s in Graphs without Antitriangle},
author={Stanislaw P. Radziszowski and Jin Ming Xia},
year={2007}
}