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

Akimichi Takemura; Taisei Kudo

arxiv: 1102.4674 · v1 · pith:UII6EEYYnew · submitted 2011-02-23 · 🧮 math.ST · stat.TH

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

Taisei Kudo , Akimichi Takemura This is my paper

classification 🧮 math.ST stat.TH

keywords bipartitecompleteboundcomplexitygraphgraverincidencelower

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)