Homomorphisms of sparse signed graphs (Q782945)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Homomorphisms of sparse signed graphs
scientific article

    Statements

    Homomorphisms of sparse signed graphs (English)
    0 references
    0 references
    0 references
    0 references
    29 July 2020
    0 references
    Summary: The notion of homomorphism of signed graphs, introduced quite recently, provides better interplay with the notion of minor and is thus of high importance in graph coloring. A newer, but equivalent, definition of homomorphisms of signed graphs, proposed jointly by \textit{R. Naserasr} et al. [Eur. J. Comb. 91, Article ID 103222, 20 p. (2021; Zbl 1458.05098)], leads to a basic no-homomorphism lemma. According to this definition, a signed graph \((G, \sigma)\) admits a homomorphism to a signed graph \((H, \pi)\) if there is a mapping \(\phi\) from the vertices and edges of \(G\) to the vertices and edges of \(H\) (respectively) which preserves adjacencies, incidences, and signs of closed walks (i.e., the product of the sign of their edges). For \(ij=00, 01, 10, 11\), let \(g_{ij}(G,\sigma)\) be the length of a shortest nontrivial closed walk of \((G, \sigma)\) which is, positive and of even length for \(ij=00\), positive and of odd length for \(ij=01\), negative and of even length for \(ij=10\), negative and of odd length for \(ij=11\). For each \(ij\), if there is no nontrivial closed walk of the corresponding type, we let \(g_{ij}(G, \sigma)=\infty \). If \(G\) is bipartite, then \(g_{01}(G,\sigma)=g_{11}(G,\sigma)=\infty \). In this case, \(g_{10}(G,\sigma)\) is certainly realized by a cycle of \(G\), and it will be referred to as the unbalanced-girth of \((G,\sigma)\). It then follows that if \((G,\sigma)\) admits a homomorphism to \((H, \pi)\), then \(g_{ij}(G, \sigma)\geq g_{ij}(H, \pi)\) for \(ij \in \{00, 01,10,11\} \). Studying the restriction of homomorphisms of signed graphs on sparse families, in this paper we first prove that for any given signed graph \((H, \pi)\), there exists a positive value of \(\varepsilon\) such that, if \(G\) is a connected graph of maximum average degree less than \(2+\varepsilon \), and if \(\sigma\) is a signature of \(G\) such that \(g_{ij}(G, \sigma)\geq g_{ij}(H, \pi)\) for all \(ij \in \{00, 01,10,11\} \), then \((G, \sigma)\) admits a homomorphism to \((H, \pi)\). For \((H, \pi)\) being the signed graph on \(K_4\) with exactly one negative edge, we show that \(\varepsilon=\frac{4}{7}\) works and that this is the best possible value of \(\varepsilon \). For \((H, \pi)\) being the negative cycle of length \(2g\), denoted \(UC_{2g}\), we show that \(\varepsilon=\frac{1}{2g-1}\) works. As a bipartite analogue of the Jaeger-Zhang conjecture, \textit{R. Naserasr} et al. conjectured in [J. Graph Theory 79, No. 3, 178--212 (2015; Zbl 1322.05069)] that every signed bipartite planar graph \((G,\sigma)\) satisfying \(g_{ij}(G,\sigma)\geq 4g-2\) admits a homomorphism to \(UC_{2g}\). We show that \(4g-2\) cannot be strengthened, and, supporting the conjecture, we prove it for planar signed bipartite graphs \((G,\sigma)\) satisfying the weaker condition \(g_{ij}(G,\sigma)\geq 8g-2\). In the course of our work, we also provide a duality theorem to decide whether a 2-edge-colored graph admits a homomorphism to a certain class of 2-edge-colored signed graphs or not.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references