Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2502.07769

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs

Tala Eagling-Vose·Barnaby Martin·Daniel Paulusma·Siani Smith
View original source ↗Read source document ↗Export metadata ↓

Abstract

We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and self-loops. We study specifically the problems Multigraph Matching Cut, Multigraph d-Cut and Partially Reflexive Stable Cut in this connection. The last may be seen as a Surjective Homomorphism problem to a path P_3 in which both leaves are looped while the interior vertex is loopless. We consider also another family of Surjective Homomorphism problems to a cycle in which only one vertex is loopless. When one forbids a single (simple) subgraph, our first three problems exhibit the same complexity behaviour as C123-problems, but on finite sets of forbidden subgraphs, the classification appears more complex. While Multigraph Matching Cut and Multigraph d-Cut have the same classification as C123-problems, already Partially Reflexive Stable Cut fails to have. This is witnessed by forbidding as subgraphs both C_3 and H_1. Indeed, the difference of behaviour occurs only around pendant subdivisions of nets and pendant subdivisions of H_1. We examine this area in close detail. Our other Surjective Homomorphism problem, ostensibly somewhat similar to Partially Reflexive Stable Cut, behaves very differently when the input is restricted to some class that is H-subgraph-free. For example, it is solvable in polynomial time on any class of bounded degree. Also, its hardness will never be preserved under any form of edge subdivision.

Explore related subjects

math.COcs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tala Eagling-Vose, Barnaby Martin, Daniel Paulusma, Siani Smith. 2026-02-10. Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs. https://arxiv.org/abs/2502.07769

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗