Abstract
In 1940, Lebesgue proved that every 3-polytope with minimum degree at least 4 contains a 3-face for which the set of degrees of its vertices is majorized by one of the entries: (4, 4,∞), (4, 5, 19), (4, 6, 11), (4, 7, 9), (5, 5, 9), and (5, 6, 7). This description was strengthened by Borodin (2002) to (4, 4,∞), (4, 5, 17), (4, 6, 11), (4, 7, 8), (5, 5, 8), and (5, 6, 6).
For triangulations with minimum degree at least 4, Jendrol’ (1999) gave a description of faces: (4, 4,∞), (4, 5, 13), (4, 6, 17), (4, 7, 8), (5, 5, 7), and (5, 6, 6).
We obtain the following description of faces in plane triangulations (in particular, for triangulated 3-polytopes) with minimum degree at least 4 in which all parameters are best possible and are attained independently of the others: (4, 4,∞), (4, 5, 11), (4, 6, 10), (4, 7, 7), (5, 5, 7), and (5, 6, 6).
In particular, we disprove a conjecture by Jendrol’ (1999) on the combinatorial structure of faces in triangulated 3-polytopes.
Similar content being viewed by others
References
Steinitz E., “Polyheder und Raumeinteilungen,” Enzykl. Math. Wiss. (Geometrie), 3AB, No. 12, 1–139 (1922).
Lebesgue H., “Quelques conséquences simples de la formule d’Euler,” J. Math. Pures Appl., 19, 27–43 (1940).
Borodin O. V., “Colorings of plane graphs: a survey,” Discrete Math., 313, No. 4, 517–539 (2013).
Kotzig A., “From the theory of Eulerian polyhedra,” Mat. Čas., 13, 20–34 (1963).
Borodin O. V., “Solving the Kotzig and Grünbaum problems on the separability of a cycle in planar graphs,” Mat. Zametki, 46, No. 5, 9–12 (1989). (English translation: Math. Notes, 46, No. 5–6, 835–837 (1989).
Grünbaum B., “Polytopal graphs,” in: Studies in Graph Theory, Washington, D.C., Math. Assoc. Amer., Vol. 12, 1975, pp. 201–224 (MAA Stud. Math.).
Plummer M. D., “On the cyclic connectivity of planar graphs,” in: Graph Theory and Applications, Springer-Verlag, Berlin, 1972, pp. 235–242.
Kotzig A., “Extremal polyhedral graphs,” Ann. New York Acad. Sci., 319, 569–570 (1979).
Borodin O. V., “Minimal weight of a face in planar triangulations without 4 -vertices,” Mat. Zametki, 51, No. 1, 16–19 (1992). (English translation: Math. Notes, 51, No. 1–2, 11–13 (1992).)
Borodin O. V., “Triangulated 3-polytopes with restricted minimal weight of faces,” Discrete Math., 186, 281–285 (1998).
Jendroľ S., “Triangles with restricted degrees of their boundary vertices in plane triangulations,” Discrete Math., 196, 177–196 (1999).
Borodin O. V., “Strengthening Lebesgue’s theorem on the structure of the minor faces in convex polyhedra,” Diskretn. Anal. Issled. Oper. Ser. 1, 9, No. 3, 29–39 (2002).
Jendrol’ S. and Voss H.-J., “Light subgraphs of graphs embedded in the plane and in the projective plane: a survey,” Discrete Math., 313, 406–421 (2013).
Borodin O. V. and Ivanova A. O., “Describing 3-faces in normal plane maps with minimum degree 4,” Discrete Math., 313, No. 23, 2841–2847 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2014 Borodin O.V. and Ivanova A.O.
The authors were supported by the Russian Foundation for Basic Research (Grants 12-01-00631 and 12-01-00448 (the first author) and Grants 12-01-00448 and 12-01-98510 (the second author)).
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 55, No. 1, pp. 17–24, January–February, 2014.
Rights and permissions
About this article
Cite this article
Borodin, O.V., Ivanova, A.O. Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4. Sib Math J 55, 12–18 (2014). https://doi.org/10.1134/S0037446614010030
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446614010030