Abstract
It is trivial that every 3-polytope has a face of degree at most 5, called minor. Back in 1940, Lebesgue gave an approximate description of minor faces in 3-polytopes. Borodin (Diskretn Anal Issled Oper 9(3), 29–35, 2002) improved Lebesgue’s description on six parameters and suggested to find a tight description of minor faces. By now, such a tight description has been obtained only for several restricted classes of 3-polytopes. In 1976, Steinberg conjectured that every planar graph without 4-cycles and without 5-cycles is 3-colorable. Since 1993, a lot of research has been devoted to coloring sparse plane graphs, defined in terms of forbidding certain sets of cycle-lengths. One of the purposes of our paper is to suggest a similar approach to finding a tight version of Lebesgue’s description of minor faces; namely, by forbidding certain sets of vertex degrees. More specifically, a face is of type \((k_1,k_2,\ldots )\) if the set of degrees of its incident vertices is majorized by the vector \((k_1,k_2, \ldots )\). It follows from results by Horňák and Jendrol’ (Discus Math Graph Theory 16(2), 123–142, 1996) that every 3-polytope without vertices of degree from 4 to 7 has a face of one of the types \((3,3,\infty )\), (3, 8, 15), (3, 9, 14), (3, 10, 13), \((3,3,3,\infty )\), and (3, 3, 3, 3, 3). The other purpose of our paper is to obtain a description “\((3,3,\infty )\), (3, 8, 14), (3, 10, 12), \((3,3,3,\infty )\), (3, 3, 3, 3, 3)”, where all parameters are best possible.
Similar content being viewed by others
References
Abbott, H.L., Zhou, B.: On small faces in 4-critical graphs. Ars Comb. 32, 203–207 (1991)
Avgustinovich, S.V., Borodin, O.V.: Neighborhoods of edges in normal maps (Russian). Diskret. Anal. Issled. Oper. 2(3), 3–9 (1995)
Borodin, O.V.: Solution of Kotzig’s and Grünbaum’s problems on the separability of a cycle in a planar graph (Russian). Matem. Zametki 46(5), 9–12 (1989)
Borodin, O.V.: Minimal weight of face in plane triangulations without 4-vertices (Russian). Matem. Zametki 51(1), 16–19 (1992)
Borodin, O.V.: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J. Graph Theory 21(2), 183–186 (1996)
Borodin, O.V.: Triangulated 3-polytopes with restricted minimal weight of faces. Discrete Math. 186, 281–285 (1998)
Borodin, O.V., Loparev, D.V: The height of small faces in planar normal maps (Russian). Diskretn. Anal. Issled. Oper. Ser. 1 5(4), 6–17 (1998)
Borodin, O.V., Woodall, D.R.: The weight of faces in plane maps (Russian). Mat. Zametki 64(5), 648–657 (1998)
Borodin, O.V.: An improvement of Lebesgues theorem on the structure of minor faces of 3-polytopes (Russian). Diskretn. Anal. Issled. Oper. 9(3), 29–35 (2002)
Borodin, O.V., Glebov, A.N., Raspaud, A., Salavatipour, M.R.: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Combin. Theory Ser. B 93, 303–311 (2005)
Borodin, O.V.: Colorings of plane graphs: a survey. Discrete Math. 313(4), 517–539 (2013)
Borodin, O.V., Ivanova, A.O.: Describing 3-faces in normal plane maps with minimum degree 4. Discrete Math. 313(23), 2841–2847 (2013)
Borodin, O.V., Ivanova, A.O., Kostochka, A.V.: Describing faces in plane triangulations. Discrete Math. 319, 47–61 (2014)
Borodin, O.V., Ivanova, A.O.: Low edges in 3-polytopes. Discrete Math. 338(12), 2234–2241 (2015)
Borodin, O.V., Ivanova, A.O.: Heights of minor faces in triangle-free 3-polytopes (Russian). Sibirsk. Mat. Zh. 56(5), 982–988 (2015)
Cohen-Addad, V., Hebdige, M., Král, D., Li, Zhentao, Salgado, E.: Steinbergs conjecture is false. arXiv:1604.05108 [math.CO]
Grötzsch, H.: Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin Luther Univ. Halle Wittenberg Math. Natur. Reihe 8, 109–120 (1959)
Grünbaum, B.: Polytopal graphs, studies in graph theory (D.R. Fulkerson, ed.). MAA. Stud. Math. 12, 201–224 (1975)
Horňák, M., Jendrol’, S.: Unavoidable sets of face types for planar maps. Discus. Math. Graph Theory 16(2), 123–142 (1996)
Jendrol’, S.: Triangles with restricted degrees of their boundary vertices in plane triangulations. Discrete Math. 196, 177–196 (1999)
Jendrol’, S., Voss, H.-J.: Light subgraphs of graphs embedded in the plane and in the projective plane—a survey. Discrete Math. 313(4), 406–421 (2013)
Kotzig, A.: From the theory of Eulerian polyhedra (Russian). Mat. Čas. 13, 20–31 (1963)
Kotzig, A.: Extremal polyhedral graphs. Ann. NY Acad. Sci. 319, 569–570 (1979)
Lebesgue, H.: Quelques conséquences simples de la formule d’Euler. J. Math. Pures Appl. 19, 27–43 (1940)
Mohar, B., Škrekovski, R., Voss, H.-J.: Light subraphs in planar graphs of minimum degree 4 and edge-degree 9. J. Graph Theory 44, 261–295 (2003)
Ore, O., Plummer, M.D.: Cyclic coloration of plane graphs. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics, pp. 287–293. Academic Press, New York (1969)
Plummer, M.D.: On the Cyclic Connectivity of Planar Graph, Graph Theory and Application, pp. 235–242. Springer, Berlin (1972)
Sanders, D.P., Zhao, Y.: A note on the three color problem. Graphs Comb. 11, 91–94 (1995)
Steinberg, R.: The state of the Three Color Problem. In: Gimbel, J., Kennedy, J.W., Quintas, L.V. (eds.) Quo Vadis, Graph Theory? Annals of Discrete Math., vol. 55, pp. 211–248 (1993)
Steinitz, E.: Polyeder und Raumeinteilungen. Enzykl. Math. Wiss. (Geometrie) 3AB 12, 1–139 (1922)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was funded by the Russian Science Foundation (Grant 16-11-10054).
Rights and permissions
About this article
Cite this article
Borodin, O.V., Ivanova, A.O. & Vasil’eva, E.I. A Steinberg-Like Approach to Describing Faces in 3-Polytopes. Graphs and Combinatorics 33, 63–71 (2017). https://doi.org/10.1007/s00373-016-1743-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-016-1743-6