2000 character limit reached
4-Connected Triangulations on Few Lines (1908.04524v2)
Published 13 Aug 2019 in math.CO
Abstract: We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all subgraphs of such triangulations. The proof is based on a corresponding result for diagrams of planar lattices which makes use of orthogonal chain and antichain families.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.