An upper bound on the number of edges of a Gomory corner polyhedron
We establish the first nontrivial upper bound on the number of edges of a Gomory corner polyhedron, resolving a long-standing open question. For an $n$-dimensional corner polyhedron associated with an integer lattice of determinant $δ$, the number of edges is at most $$ O\left(n6^n \cdot \bigl(1+\log_2(2δ)\bigr)^{2n-3}\right). $$ This improves the standard bound obtained by counting pairs of vertices, reducing the logarithmic exponent from $(2n-2)$ to $(2n-3)$.
Authors
- D. V. Gribanov (ORCID: https://orcid.org/0000-0002-4005-9483)
- S. I. Veselov
- D. S. Malyshev
- A. Yu. Chirkov
- N. Yu. Zolotykh
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16839
- Primary Topic
- Complexity and Algorithms in Graphs
- Type
- preprint