The smallest graphs with certain adjacency properties

摘要: A graph is said to have property P"1,"n if for every sequence of n + 1 points, there another point adjacent only the first point. It has previously been shown that almost all graphs P"1,"n. easy verify each n, a cube with this property. more delicate question asks construction smallest having We find problem intimately related discovery highly symmetric known as cages, and are thereby enabled resolve 1=