3 problems

0 votes0 replies0 views
Low–Roberts conjecture on connected simple Hartke magic graphs
Let $p\geq 3$ be prime. A Hartke $\mathbb{Z}_p$ -magic graph is a graph with the Hartke magic-labeling property over $\mathbb{Z}_p$ ; its order is its number of vertices. Low–Roberts…
Conjectureopencombinatorial-nullstellensatz finite-fields graph-labelingsarXiv posted 2 days ago
0 votes0 replies0 views
Nonzero-coefficient conjecture for the Combinatorial Nullstellensatz framework
Nonzero-coefficient conjecture. One can choose the identifier spanning trees in a way that there is a Vandermonde-completable monomial with nonzero coefficient in
Conjectureopencombinatorial-nullstellensatz graph-orientations hypergraph-coloringarXiv posted 2 days ago
0 votes0 replies1 view
West's PPA conjecture for the Combinatorial Nullstellensatz over $\mathbb{F}_2$
The Combinatorial Nullstellensatz search problem over $\mathbb{F}_2=\{0,1\}$ asks for a nonzero Boolean vector witnessing the corresponding nullstellensatz conclusion. West's PPA c…
Conjecturesolvedcombinatorial-nullstellensatz computational-complexityarXiv posted 2 days ago

Low–Roberts conjecture on connected simple Hartke magic graphs