A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
Kudo, Taisei · Takemura, Akimichi
Original · EN
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 by Berstein and Onn (2009) for 3xr complete bipartite graphs, r ≥ 3.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.