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

preprint2011arXivOpen access

Abstract

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 \ge 3.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.