Pith. sign in

REVIEW

Interplay of Cubic Graphs and Simplicial Surfaces

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.22137 v2 pith:OKKGTXPA submitted 2024-10-29 math.CO

Interplay of Cubic Graphs and Simplicial Surfaces

classification math.CO
keywords simplicialcubicgraphssurfacesconnectededgesembeddedembeddings
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Simplicial surfaces describe the incidence relations between vertices, edges and faces of triangulated 2-dimensional manifolds in a purely combinatorial way. By considering only the incidences of edges and faces, simplicial surfaces are closely related to cubic graphs. In this paper we investigate how properties of simplicial surfaces and cubic graphs can be transferred to each other. Furthermore, we study embeddings of cubic graphs on simplicial surfaces and how they are connected to strong graph embeddings. For instance, 3-connected cubic planar graphs are uniquely embeddable on simplicial spheres, which is a direct consequence of Whitney's embedding theorem. Moreover, 3-connected cubic planar graphs can also be embedded on simplicial surfaces of higher genus. We characterise the properties that a simplicial sphere must possess such that the cubic graph describing its edge-face incidence relation can be embedded on a simplicial surface of non-negative Euler characteristic.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.