Search arXivSearch

arXiv · 2501.00596

A Fano framework for embeddings of graphs in surfaces

Abstract

We consider seven fundamental properties of cellular embeddings of graphs in compact surfaces, and show that each property can be associated with a point of the Fano plane $F$, in such a way that allowable combinations of properties correspond to projective subspaces of $F$. This Fano framework allows us to deduce a number of implications involving the seven properties, providing new results and unifying existing ones. For each property, we provide a correspondence between embeddings with that property and an associated structure for $4$-regular graphs, using the medial graph of the graph embedding. We apply this to characterize when a graph embedding has a twisted dual with one of the properties. For each allowable combination of properties, we show that a graph embedding with these properties exists. We investigate connections between the seven properties and three weaker `Eulerian' properties. Our proofs involve parity conditions on closed walks in an extended version of the `gem' (graph-encoded map) representation of a graph embedding.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Blake Dunshee, M. N. Ellingham. 2024-12-31. A Fano framework for embeddings of graphs in surfaces. https://arxiv.org/abs/2501.00596

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO