Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2403.00497

Graph Homomorphism, Monotone Classes and Bounded Pathwidth

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

Abstract

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational complexity can be described for all such graph classes, giving a dichotomy between those classes for which the problem is hard and those for which it is easy. In this article, we consider several variants of the homomorphism problem in relation to this framework. It is known that certain homomorphism problems, e.g. $C_5$-Colouring, do not sit in the framework. By contrast, we show that the more general problem of Graph Homomorphism does sit in the framework, with hard cases NP-complete and easy cases in P. We go on to consider several locally constrained variants of the homomorphism problem, namely the locally bijective, surjective and injective variants. Like $C_5$-Colouring, none of these is in the framework. However, where a bounded-degree restrictions are considered, we prove that each of these problems is in our framework, with hard cases NP-complete and easy cases in P Next, we give the first example of a problem in the framework such that hardness is in the polynomial hierarchy above NP. This comes from a list colouring game, realised through first-order logic as quantified constraints. We show that with the additional restriction of bounded alternation, the problem is contained in the framework. The hard cases are $\Pi_{2k}^\mathrm{P}$-complete and the easy cases are in P. Finally, we go on to consider an aforementioned problem from our framework, complete for the second level of the polynomial hierarchy, under the omission in the input of not just a graph, but rather a graph $H$ annotated with the types for each vertex: existential or universal.

Explore related subjects

cs.CCcs.LO

Keep this discovery

BibTeXRIS

Tala Eagling-Vose, Barnaby Martin, Daniel Paulusma, Siani Smith. 2024-03-01. Graph Homomorphism, Monotone Classes and Bounded Pathwidth. https://arxiv.org/abs/2403.00497

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

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗