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

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

2011-02-23

arxiv.org/abs/1102.4674v1

Mathematics

Statistics Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-174318