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

DOI10.4310/JOC.2012.v3.n4.a7zbMath1269.05018arXiv1102.4674MaRDI QIDQ2375856

Taisei Kudo, Akimichi Takemura

Publication date: 25 June 2013

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.4674

zbMATH Keywords

contingency tablealgebraic statisticsthree-way transportation program

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory ⋮ Asymptotic behavior of Markov complexity ⋮ Convex integer optimization by constantly many linear counterparts ⋮ Unboundedness of Markov complexity of monomial curves in \(\mathbb{A}^n\) for \(n \geq 4\) ⋮ Lower bounds on the graver complexity of \(M\)-fold matrices

This page was built for publication: A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph