A296416 Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R^4. A graph G is abstract almost-equidistant in R^4 if the complement of G does not contain K_3 and G does not contain K_6 nor K_{1,3,3}.

1, 2, 3, 7, 14, 37, 97, 316, 934, 2362, 2814, 944, 59, 4, 1, 1, 0

Offset

1,2

Comments

A set of points in R^d is called almost equidistant if for any three points, some two are at unit distance.

Links

Table of n, a(n) for n=1..17.

Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, Almost-equidistant sets, arXiv:1706.06375 [math.MG], 2017.

Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, Almost-equidistant sets [supplemental data], 2017.

Crossrefs

Cf. A296414, A296415, A296417, A296418, A006785.

Sequence in context: A245899 A246747 A090828 * A049367 A089790 A296417

Adjacent sequences: A296413 A296414 A296415 * A296417 A296418 A296419

Keyword

nonn,fini,full

Author

Manfred Scheucher, Dec 11 2017

Status

approved