Abstract: The weight w(e) of an edge e in a 3-polytope is the degree-sum of its endvertices. An edge e = uv is an (i, j)-edge if d(u) ≤ i and d(v) ≤ j. In 1940 Lebesgue proved that every 3-polytope has a (3, 11)-edge, or (4, 7)-edge, or (5, 6)-edge, where 7 and 6 are best possible. In 1955, Kotzig proved that every 3-polytope has an edge e with w(e) ≤ 13, which bound is sharp. Borodin (1987), answering Erdo˝s’ question of 1976, proved that every plane graph without vertices of degree less than 3 has such an edge. Moreover, Borodin (1991) refined this by proving that there is either a (3, 10)-edge, or (4, 7)-edge, or (5, 6)-edge. Given a 3-polytope, the minimum weight of all its edges is denoted by w, of those incident with just one 3-face and called semi-weak is w∗, and those incident with two 3-faces and called weak, is w∗∗. Borodin (1996) proved that if w∗∗ = ∞, that is there are no weak edges, then either w∗ ≤ 9 or w ≤ 8, where both bounds are sharp. Recently, we refined this fact by proving that w∗∗ = ∞ implies either a semi-weak (3, 6)-edge, or semi-weak (4, 4)-edge, or else a strong (3, 5)-edge, which description is tight. (Note that if (3, 5)-edges are allowed, then there may be no 3-faces, and hence semi-weak edges, at all.) The purpose of our note is to further refine these results by proving that in fact w∗∗ = ∞ implies either a semi-weak (3, 6)-edge, or semi-weak (4, 4)-edge, or a strong (3, 5)-edge incident with a 4-face, or else a strong (3, 3)-edge incident with a 5-face, where no parameter can be improved.

Cite: Borodin O.V. , Ivanova A.O.
Describing edges incident with minor faces in 3-polytopes without adjacent 3-faces
Математические заметки СВФУ (Mathematical Notes of NEFU). 2025. V.32. N2. P.50-55. DOI: 10.25587/2411-9326-2025-2-50-55 РИНЦ

Dates:

Submitted:	Jan 24, 2025
Accepted:	May 27, 2025
Published print:	Jul 5, 2025
Published online:	Jul 5, 2025

Identifiers:

Elibrary:

82558751

Citing: Пока нет цитирований

Altmetrics: