STATUS
proposed
proposed
editing
For the definition of Skolem number of a graph, see Definitions 1.4 and 1.5 in Carrigan and Green.
For the definition of Skolem number of a graph, see Definition 1.4 and 1.5 in Carrigan and Green.
Braxton Carrigan and Garrett Green, <a href="https://research.library.kutztown.edu/contact/vol2/iss1/2/">Skolem Number of Subgraphs on the Triangular Lattice</a>, Communications on Number Theory and Combinatorial Theory 2 (2021), Article 2 (see Theorem 3.3).
T(n, k) = k*n - 2*k - n + 4. Sum_{k=2..n}
T(n, k) = A229183(n-1).
allocated for Stefano Spezia
allocated
approved