Mathematics > Combinatorics
[Submitted on 2 Jun 2022 (v1), last revised 2 Mar 2023 (this version, v3)]
Title:Min orderings and list homomorphism dichotomies for signed and unsigned graphs
View PDFAbstract:The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many contexts, including for instance nowhere-zero flows for graphs embedded in non-orientable surfaces. For a fixed signed graph $\widehat{H}$, the list homomorphism problem asks whether an input signed graph $\widehat{G}$ with lists $L(v) \subseteq V(\widehat{H}), v \in V(\widehat{G}),$ admits a homomorphism $f$ to $\widehat{H}$ with all $f(v) \in L(v), v \in V(\widehat{G})$. Usually, a dichotomy classification is easier to obtain for list homomorphisms than for homomorphisms, but in the context of signed graphs a structural classification of the complexity of list homomorphism problems has not even been conjectured, even though the classification of the complexity of homomorphism problems is known. Kim and Siggers have conjectured a structural classification in the special case of ``weakly balanced" signed graphs. We confirm their conjecture for reflexive and irreflexive signed graphs; this generalizes previous results on weakly balanced signed trees, and weakly balanced separable signed graphs \cite{separable,trees}. In the reflexive case, the result was first presented in \cite{KS}, with the proof using some of our results included in this paper. In fact, here we present our full proof, as an alternative to the proof in \cite{KS}. In particular, we provide direct polynomial algorithms where previously algorithms relied on general dichotomy theorems. The irreflexive results are new, and their proof depends on first deriving a theorem on extensions of min orderings of (unsigned) bipartite graphs, which is interesting on its own. [shortened, full abstract in PDF]
Submission history
From: Jan Bok [view email][v1] Thu, 2 Jun 2022 14:34:38 UTC (70 KB)
[v2] Sun, 24 Jul 2022 21:07:26 UTC (74 KB)
[v3] Thu, 2 Mar 2023 21:03:44 UTC (263 KB)
Current browse context:
math.CO
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.