2 problems
Let be prime. A Hartke -magic graph is a graph with the Hartke magic-labeling property over ; its order is its number of vertices. Low–Roberts…
Nonzero-coefficient conjecture. One can choose the identifier spanning trees in a way that there is a Vandermonde-completable monomial with nonzero coefficient in