Search arXivSearch

arXiv · 2512.24252

Simple factor graphs associated with split graphs

Abstract

We introduce and study a loopless multigraph associated with a split graph $(S,K,I)$: its factor graph $Φ(S,K,I)$, whose vertex set is $I$ and whose edges, counted with multiplicity, record the 2-switches acting on $S$. In contrast with the $A_4$-structure $\mathcal{A}_4(S)$ introduced by Barrus and West, the factor graph is supported on the independent set alone; it is therefore more compact and, although it retains less information, it still determines the 2-switch-degree of $S$. We show that an active split graph is indecomposable if and only if its factor graph is connected, an analogue for split graphs of the Barrus--West characterization of indecomposable graphs. Finally, we describe completely the active split graphs whose factor graph is simple and connected.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Nicolas Schvöllner, Adrian Pastine. 2026-09-03. Simple factor graphs associated with split graphs. https://arxiv.org/abs/2512.24252

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