DeepAI AI Chat
Log In Sign Up

Adjacency Graphs of Polyhedral Surfaces

by   Elena Arseneva, et al.

We study whether a given graph can be realized as an adjacency graph of the polygonal cells of a polyhedral surface in ℝ^3. We show that every graph is realizable as a polyhedral surface with arbitrary polygonal cells, and that this is not true if we require the cells to be convex. In particular, if the given graph contains K_5, K_5,81, or any nonplanar 3-tree as a subgraph, no such realization exists. On the other hand, all planar graphs, K_4,4, and K_3,5 can be realized with convex cells. The same holds for any subdivision of any graph where each edge is subdivided at least once, and, by a result from McMullen et al. (1983), for any hypercube. Our results have implications on the maximum density of graphs describing polyhedral surfaces with convex cells: The realizability of hypercubes shows that the maximum number of edges over all realizable n-vertex graphs is in Ω(n log n). From the non-realizability of K_5,81, we obtain that any realizable n-vertex graph has O(n^9/5) edges. As such, these graphs can be considerably denser than planar graphs, but not arbitrarily dense.


page 7

page 18


Universal Geometric Graphs

We introduce and study the problem of constructing geometric graphs that...

The maximum size of adjacency-crossing graphs

An adjacency-crossing graph is a graph that can be drawn such that every...

The structure of k-planar graphs

Dujmović et al. (FOCS 2019) recently proved that every planar graph is a...

Supercards, Sunshines and Caterpillar Graphs

The vertex-deleted subgraph G-v, obtained from the graph G by deleting t...

How to Realize a Graph on Random Points

We are given an integer d, a graph G=(V,E), and a uniformly random embed...

Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph

We investigate special structures due to automorphisms in isogeny graphs...

Reconstructing a Polyhedron between Polygons in Parallel Slices

Given two n-vertex polygons, P=(p_1, …, p_n) lying in the xy-plane at z=...