A296418 - OEIS

A296418

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

1, 2, 3, 7, 14, 38, 107, 409, 1888, 12064, 103333, 1217849, 19170728

(list; graph; refs; listen; history; text; internal format)

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..13.

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, A296416, A296417, A006785.

Sequence in context: A049367 A089790 A296417 * A006785 A274538 A113182

Adjacent sequences: A296415 A296416 A296417 * A296419 A296420 A296421

KEYWORD

nonn,fini,more

AUTHOR

Manfred Scheucher, Dec 11 2017

STATUS

approved