A dual proof of the upper bound conjecture for convex polytopes.

DOI10.7146/math.scand.a-11854zbMath0437.52001OpenAlexW2534112219WikidataQ123202151 ScholiaQ123202151MaRDI QIDQ3878314

Aage Bondesen, Arne Brøndsted

Publication date: 1980

Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/166692

zbMATH Keywords

f-vectors

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Polytopes and polyhedra (52Bxx)

Related Items

A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector, A simple proof of the upper bound theorem