Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Polyhedral Realization with Isosceles Triangles (2009.00116v1)

Published 31 Aug 2020 in cs.CG

Abstract: Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene triangle. Our construction is based on Kleetopes, and shows that there exists an integer $i$ such that all convex $i$-iterated Kleetopes have a scalene face. However, we also show that all Kleetopes of triangulated polyhedral graphs have non-convex non-self-crossing realizations in which all faces are isosceles. We answer another question of Malkevitch by observing that a spherical tiling of Dawson (2005) leads to a fourth infinite family of convex polyhedra in which all faces are congruent isosceles triangles, adding one to the three families previously known to Malkevitch. We prove that the graphs of convex polyhedra with congruent isosceles faces have bounded diameter and have dominating sets of bounded size.

Citations (2)

Summary

We haven't generated a summary for this paper yet.