A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph

Taisei Kudo, Akimichi Takemura

We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result b…