|
|
A296417
|
|
Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R^5. A graph G is abstract almost-equidistant in R^5 if the complement of G does not contain K_3 and G does not contain K_7 nor K_{3,3,3}.
|
|
4
|
|
|
1, 2, 3, 7, 14, 38, 106, 402, 1817, 11132, 86053, 803299, 7623096, 58770989
(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
|
Martin Balko, Attila Pór, Manfred Scheucher, Konrad Swanepoel, and Pavel Valtr, Almost-equidistant sets, arXiv:1706.06375 [math.MG], 2017.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,fini
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|