A360409 - OEIS

%I #23 Feb 19 2023 18:00:31

%S 2,4,6,8,6,12,14,16,12,10,22,26,28,30,32,20,18,16,14,42,54,56,58,60,

%T 62,64,40,32,28,26,24,22,78,102,106,116,118,120,122,124,126,128,70,56,

%U 50,44,38,36,34,32,30,150,206,210,230,234,240,244,246,248,250,252,254

%N The minimum number of facets among all symmetric edge polytopes for connected graphs on n vertices having m edges for n >= 2 and m between n-1 and binomial(n,2).

%H B. Braun and K. Bruegge, <a href="https://arxiv.org/abs/2201.13303">Facets of Symmetric Edge Polytopes for Graphs with Few Vertices</a>, arXiv:2201.13303 [math.CO], 2022.

%e The triangular array starts:

%e [2]: 2;

%e [3]: 4, 6;

%e [4]: 8, 6, 12, 14;

%e [5]: 16, 12, 10, 22, 26, 28, 30;

%e [6]: 32, 20, 18, 16, 14, 42, 54, 56, 58, 60, 62;

%e [7]: 64, 40, 32, 28, 26, 24, 22, 78, 102, 106, 116, 118, 120, 122, 124, 126

%Y Cf. A360408.

%K nonn,tabf

%O 2,1

%A _Benjamin Braun_, Feb 06 2023