|
%I #9 Dec 11 2017 17:40:25
%S 1,2,3,7,14,37,97,316,934,2362,2814,944,59,4,1,1,0
%N 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}.
%C A set of points in R^d is called almost equidistant if for any three points, some two are at unit distance.
%H Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, <a href="https://arxiv.org/abs/1706.06375">Almost-equidistant sets</a>, arXiv:1706.06375 [math.MG], 2017.
%H Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, <a href="http://page.math.tu-berlin.de/~scheuch/supplemental/almost_equidistant_sets/">Almost-equidistant sets [supplemental data]</a>, 2017.
%Y Cf. A296414, A296415, A296417, A296418, A006785.
%K nonn,fini,full
%O 1,2
%A _Manfred Scheucher_, Dec 11 2017
|
