RUS  ENG
Full version
JOURNALS // Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports] // Archive

Sib. Èlektron. Mat. Izv., 2014 Volume 11, Pages 457–463 (Mi semr501)

This article is cited in 3 papers

Discrete mathematics and mathematical cybernetics

The weight of edge in 3-polytopes

O. V. Borodina, A. O. Ivanovab

a Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
b Ammosov North-Eastern Federal University, str. Kulakovskogo, 48, 677013, Yakutsk, Russia

Abstract: The height of an edge in 3-polytopes is the maximum degree of its incident vertices and faces. In 1940, Lebesgue proved that each 3-polytope without pyramidal edges has an edge of height at most 11. This upper bound was lowered to 10 by Avgustinovich and Borodin (1995). The best known lower bound for the height of edges is 7.
We lower upper bound to 9 and give a construction of 3-polytope which has no edges of height smaller than 8.

Keywords: planar map, planar graph, 3-polytope, structural properties, height.

UDC: 519.172.2

MSC: 05C15

Received June 2, 2014, published June 16, 2014



© Steklov Math. Inst. of RAS, 2024