Search arXivSearch

arXiv · 2507.14530

On the subdirect product of graph bundles

Abstract

The subdirect product of two finite groups $A$ and $B$ is defined as a subgroup of the direct product $A \times B$, which is a well-known notion in finite group theory. While it is clear that, under appropriate choices of sets of generators $S$, $S_A$ and $S_B$, the Cayley graph $Cay(A \times B, S)$ corresponds to the Cartesian product $Cay(A, S_A) \square Cay(B, S_B)$ of two graphs, there is no analogue at the level of graph product that reflects the notion of subdirect product of groups. This is precisely the problem which we discuss here. By using the concept of graph bundles and the corresponding pullbacks, we introduce an operation on graph bundles such that the Cayley graph of the subdirect product of two groups can be described as the total space of the product of the Cayley graphs. This allows us to define the so-called ``network $K$-theory group of a graph'', inspired by the notion of topological $K$-theory, and we are able to investigate an interesting functor from the category of graphs to the category of abelian groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanga Bavuma, Francesco G. Russo, Stefano Spessato. 2025-07-19. On the subdirect product of graph bundles. https://doi.org/10.1007/s10986-026-09716-3

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