Extended Double Covers and Homomorphism Bounds of Signed Graphs
Florent Foucaud, Reza Naserasr, Rongxing Xu

TL;DR
This paper explores the properties of Extended Double Covers of signed graphs, proposing a conjecture that extends the Four-Color Theorem, and investigates homomorphism bounds for specific subclasses of signed graphs.
Contribution
It introduces a new conjecture linking planarity and Extended Double Covers of signed graphs, and proves it for signed $K_4$-minor free graphs, advancing the theory of graph homomorphisms.
Findings
Proved the conjecture for signed $K_4$-minor free graphs.
Developed nearly optimal homomorphism bounds for subclasses with girth restrictions.
Introduced the concept of weighted signed graphs.
Abstract
A \emph{signed graph} is a graph together with an assignment . The notion of homomorphisms of signed graphs is a relatively new development which allows to strengthen the connection between the theories of minors and colorings of graphs. Following this thread of thoughts, we investigate this connection through the notion of Extended Double Covers of signed graphs, which was recently introduced by Naserasr, Sopena and Zaslavsky. More precisely, we say that a signed graph is planar-complete if any planar signed graph which verifies the conditions of a basic no-homomorphism lemma with respect to admits a homomorphism to . Our conjecture then is that: if is a connected signed graph with no positive odd closed walk which is planar-complete, then its Extended Double Cover ${\rm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Limits and Structures in Graph Theory
