A quasi-polynomial bound for the diameter of graphs of polyhedra

Gil Kalai; Daniel J. Kleitman

doi:10.1090/S0273-0979-1992-00285-9

A quasi-polynomial bound for the diameter of graphs of polyhedra

Gil Kalai, Daniel J. Kleitman

Einstein Institute of Mathematics

Research output: Contribution to journal › Comment/debate

91 Scopus citations

Abstract

The diameter of the graph of a d-dimensional polyhedron with n facets is at most n^{log d+2}.

Original language	English
Pages (from-to)	315-316
Number of pages	2
Journal	Bulletin of the American Mathematical Society
Volume	26
Issue number	2
DOIs	https://doi.org/10.1090/S0273-0979-1992-00285-9
State	Published - Apr 1992

Access to Document

10.1090/S0273-0979-1992-00285-9

Cite this

@article{b12b2586f19e46cab4dc37b929a1ab1d,

title = "A quasi-polynomial bound for the diameter of graphs of polyhedra",

abstract = "The diameter of the graph of a d-dimensional polyhedron with n facets is at most nlog d+2.",

author = "Gil Kalai and Kleitman, {Daniel J.}",

year = "1992",

month = apr,

doi = "10.1090/S0273-0979-1992-00285-9",

language = "אנגלית",

volume = "26",

pages = "315--316",

journal = "Bulletin of the American Mathematical Society",

issn = "0273-0979",

publisher = "American Mathematical Society",

number = "2",

}

TY - JOUR

T1 - A quasi-polynomial bound for the diameter of graphs of polyhedra

AU - Kalai, Gil

AU - Kleitman, Daniel J.

PY - 1992/4

Y1 - 1992/4

N2 - The diameter of the graph of a d-dimensional polyhedron with n facets is at most nlog d+2.

AB - The diameter of the graph of a d-dimensional polyhedron with n facets is at most nlog d+2.

UR - http://www.scopus.com/inward/record.url?scp=84967739006&partnerID=8YFLogxK

U2 - 10.1090/S0273-0979-1992-00285-9

DO - 10.1090/S0273-0979-1992-00285-9

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.comment???

AN - SCOPUS:84967739006

SN - 0273-0979

VL - 26

SP - 315

EP - 316

JO - Bulletin of the American Mathematical Society

JF - Bulletin of the American Mathematical Society

IS - 2

ER -

A quasi-polynomial bound for the diameter of graphs of polyhedra

Abstract

Access to Document

Other files and links

Fingerprint

Cite this