Search arXiv⌕ Search

arXiv · 2109.01930

Geometric bijections between spanning subgraphs and orientations of a graph

Abstract

Let $G$ be a connected finite graph. Backman, Baker, and Yuen have constructed a family of explicit and easy-to-describe bijections $g_{σ,σ^*}$ between spanning trees of $G$ and $(σ,σ^*)$-compatible orientations, where the $(σ,σ^*)$-compatible orientations are the representatives of equivalence classes of orientations up to cycle-cocycle reversal which are determined by a cycle signature $σ$ and a cocycle signature $σ^*$. Their proof makes use of zonotopal subdivisions and the bijections $g_{σ,σ^*}$ are called \emph{geometric bijections}. In this paper, we extend the geometric bijections to subgraph-orientation correspondences. Moreover, we extend the geometric constructions accordingly. Our proofs are purely combinatorial, even for the geometric constructions. We also provide geometric proofs for partial results, which make use of zonotopal tiling, relate to Backman, Baker, and Yuen's method, and motivate our combinatorial constructions. Finally, we explain that the main results hold for \emph{regular matroids}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Changxin Ding. 2023-06-12. Geometric bijections between spanning subgraphs and orientations of a graph. https://arxiv.org/abs/2109.01930

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

KEEP EXPLORING

Related papers

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↗

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↗