A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
Statistics Theory
2013-03-29 v1 Statistics Theory
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.
Cite
@article{arxiv.1102.4674,
title = {A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph},
author = {Taisei Kudo and Akimichi Takemura},
journal= {arXiv preprint arXiv:1102.4674},
year = {2013}
}