A360409 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).

2, 4, 6, 8, 6, 12, 14, 16, 12, 10, 22, 26, 28, 30, 32, 20, 18, 16, 14, 42, 54, 56, 58, 60, 62, 64, 40, 32, 28, 26, 24, 22, 78, 102, 106, 116, 118, 120, 122, 124, 126, 128, 70, 56, 50, 44, 38, 36, 34, 32, 30, 150, 206, 210, 230, 234, 240, 244, 246, 248, 250, 252, 254

Offset

2,1

Links

Table of n, a(n) for n=2..64.

B. Braun and K. Bruegge, Facets of Symmetric Edge Polytopes for Graphs with Few Vertices, arXiv:2201.13303 [math.CO], 2022.

Example

The triangular array starts:
[2]: 2;
[3]: 4, 6;
[4]: 8, 6, 12, 14;
[5]: 16, 12, 10, 22, 26, 28, 30;
[6]: 32, 20, 18, 16, 14, 42, 54, 56, 58, 60, 62;
[7]: 64, 40, 32, 28, 26, 24, 22, 78, 102, 106, 116, 118, 120, 122, 124, 126

Crossrefs

Cf. A360408.

Sequence in context: A178699 A355311 A299477 * A319805 A055950 A294428

Adjacent sequences: A360406 A360407 A360408 * A360410 A360411 A360412

Keyword

nonn,tabf

Author

Benjamin Braun, Feb 06 2023

Status

approved