Abstract
Let \( w_{k} \) be the maximum of the minimum degree-sum (weight) of vertices in \( k \)-vertex paths (\( k \)-paths) in 3-polytopes. Trivially, each 3-polytope has a vertex of degree at most 5, and so \( w_{1}\leq 5 \). Back in 1955, Kotzig proved that \( w_{2}\leq 13 \) (so there is an edge of weight at most 13), which is sharp. In 1993, Ando, Iwasaki, and Kaneko proved that \( w_{3}\leq 21 \), which is also sharp due to a construction by Jendrol’ of 1997. In 1997, Borodin refined this by proving that \( w_{3}\leq 18 \) for 3-polytopes with \( w_{2}\geq 7 \), while \( w_{3}\leq 17 \) holds for 3-polytopes with \( w_{2}\geq 8 \), where the sharpness of 18 was confirmed by Borodin et al. in 2013, and that of 17 was known long ago. Over the last three decades, much research has been devoted to structural and coloring problems on the plane graphs that are sparse in this or that sense. In this paper we deal with 3-polytopes without adjacent 3-cycles that is without chordal 4-cycle (in other words, without \( K_{4}-e \)). It is known that such 3-polytopes satisfy \( w_{1}\leq 4 \); and, moreover, \( w_{2}\leq 9 \) holds, where both bounds are sharp (Borodin, 1992). We prove now that each 3-polytope without chordal 4-cycles has a 3-path of weight at most 15; and so \( w_{3}\leq 15 \), which is sharp.
Similar content being viewed by others
References
Wernicke P., “Über den kartographischen Vierfarbensatz,” Math. Ann., vol. 58, no. 3, 413–426 (1904).
Franklin P., “The four color problem,” Amer. J. Math., vol. 44, no. 3, 225–236 (1922).
Borodin O.V. and Ivanova A.O., “An analogue of Franklin’s Theorem,” Discrete Math., vol. 339, no. 10, 2553–2556 (2016).
Borodin O.V. and Ivanova A.O., “An extension of Franklin’s theorem,” Sib. Electr. Math. Reports, vol. 17, 1516–1521 (2020).
Ferencová B. and Madaras T., “Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight,” Discrete Math., vol. 310, no. 12, 1661–1675 (2010).
Fijavz G., Juvan M., Mohar B., and Skrekovski R., “Planar graphs without cycles of specific lengths,” Eur. J. Combinatorics, vol. 23, no. 4, 377–388 (2002).
Hudak P., Maceková M., Madaras T., and Siroczki P., “More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges,” Ars Math. Contemp., vol. 13, no. 2, 355–366 (2017).
Jendrol’ S., “Paths with restricted degrees of their vertices in planar graphs,” Czech. Math. J., vol. 49(124), no. 3, 481–490 (1999).
Jendrol’ S., “A structural property of convex 3-polytopes,” Geom. Dedicata, vol. 68, no. 1, 91–99 (1997).
Jendrol’ S. and Madaras T., “On light subgraphs in plane graphs with minimum degree five,” Discuss. Math. Graph Theory, vol. 16, no. 2, 207–217 (1996).
Madaras T., “Note on the weight of paths in plane triangulations of minimum degree 4 and 5,” Discuss. Math. Graph Theory, vol. 20, no. 2, 173–180 (2000).
Madaras T., “Two variations of Franklin’s theorem,” Tatra Mt. Math. Publ., vol. 36, 61–70 (2007).
Mohar B., Škrekovski R., and Voss H.-J., “Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9,” J. Graph Theory, vol. 44, no. 4, 261–295 (2003).
Jendrol’ S. and Voss H.-J., “Light subgraphs of graphs embedded in the plane—a survey,” Discrete Math., vol. 313, no. 4, 406–421 (2013).
Borodin O.V. and Ivanova A.O., “New results about the structure of plane graphs: a survey,” AIP Conf. Proc., vol. 1907, no. 1, 030051 (2017).
Cranston D.W., West D.B., “An introduction to the discharging method via graph coloring,” Discrete Math., vol. 340, no. 4, 766–793 (2017).
Kotzig A. and West D.B., “Contribution to the theory of Eulerian polyhedra,” Mat.-Fyz. Casopis, vol. 5, 111–113 (1955).
Ando K., Iwasaki S., and Kaneko A., “Every \( 3 \)-connected planar graph has a connected subgraph with small degree sum,” Ann. Meeting Math. Soc. Japan, vol. 11, 507–515 (1993) [Japanese].
Borodin O.V., “Minimal vertex degree sum of a 3-path in plane maps,” Discuss. Math. Graph Theory, vol. 17, no. 2, 279–284 (1997).
Borodin O.V., Ivanova A.O., Jensen T. R., Kostochka A.V., and Yancey M.P., “Describing \( 3 \)-paths in normal plane maps,” Discrete Math., vol. 313, no. 23, 2702–2711 (2013).
Dvořák Z. and Postle L., “Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8,” J. Combin. Theory Ser. B, vol. 129, 38–54 (2018).
Borodin O.V., “An extension of Kotzig’s theorem on the minimum weight of edges in 3-polytopes,” Math. Slovaca, vol. 42, no. 4, 385–389 (1992).
Funding
Borodin’s work (problem’s formulation and proof) was supported by the Ministry of Science and Higher Education of the Russian Federation (Project FWNF–2022–0017). Ivanova’s work (proof details and construction) was supported by the Ministry of Science and Higher Education of the Russian Federation (Grant no. 075–02–2023–947 of February 16, 2023).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors of this work declare that they have no conflicts of interest.
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, 2024, Vol. 65, No. 2, pp. 249–257. https://doi.org/10.33048/smzh.2024.65.202
Publisher's Note
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Borodin, O.V., Ivanova, A.O. Light 3-Paths in 3-Polytopes without Adjacent Triangles. Sib Math J 65, 257–264 (2024). https://doi.org/10.1134/S0037446624020022
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446624020022