Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.14531

Maximum genus embeddings of dense eulerian graphs with specified faces

M. N. Ellingham·Joanna A. Ellis-Monaghan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We give a density condition for when, subject to a necessary parity condition, an eulerian graph or digraph may be cellularly embedded in an orientable surface so that it has exactly two faces, each bounded by an euler circuit, one of which may be specified in advance. More generally, suppose that every vertex in an $n$-vertex eulerian digraph (loops and multiple arcs allowed) has at least $(4n+2)/5$ neighbors, and specify any decomposition of the arcs into disjoint directed circuits (closed trails). We show that such a digraph has an orientable embedding in which the given circuits are facial walks and there are exactly one or two other faces. This embedding then has maximum genus relative to the given circuits being facial walks. When there is only one other face, it is necessarily bounded by an euler circuit. Consequently, if the numbers of vertices and edges have the same parity, a sufficiently dense digraph $D$ with a given directed euler circuit $T$ has an orientable embedding with exactly two faces, each bounded by an euler circuit, one of which is $T$. These results for digraphs give analogous results for graphs as immediate corollaries. The main theorem encompasses several special cases in the literature, such as when the digraph is a tournament.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. N. Ellingham, Joanna A. Ellis-Monaghan. 2024-09-22. Maximum genus embeddings of dense eulerian graphs with specified faces. https://arxiv.org/abs/2409.14531

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗