Search arXivSearch

arXiv · 1811.03807

Homomorphism bounds of signed bipartite $K_4$-minor-free graphs and edge-colorings of $2k$-regular $K_4$-minor-free multigraphs

Abstract

A signed graph $(G, Σ)$ is a graph $G$ and a subset $Σ$ of its edges which corresponds to an assignment of signs to the edges: edges in $Σ$ are negative while edges not in $Σ$ are positive. A closed walk of a signed graph is balanced if the product of the signs of its edges (repetitions included) is positive, and unbalanced otherwise. The unbalanced-girth of a signed graph is the length of a shortest unbalanced closed walk (if such a walk exists). A homomorphism of $(G,Σ)$ to $(H,Π)$ is a homomorphism of $G$ to $H$ which preserves the balance of closed walks. In this work, given a signed bipartite graph $(B, Π)$ of unbalanced-girth $2k$, we give a necessary and sufficient condition for $(B, Π)$ to admit a homomorphism from any signed bipartite graph of unbalanced-girth at least $2k$ whose underlying graph is $K_4$-minor-free. The condition can be checked in polynomial time with respect to the order of $B$. Let $SPC(2k)$ be the signed bipartite graph on vertex set $\mathbb{Z}_2^{2k-1}$ where vertices $u$ and $v$ are adjacent with a positive edge if their difference is in $\{e_1,e_2, \ldots, e_{2k-1}\}$ (where the $e_i$'s form the standard basis), and adjacent with a negative edge if their difference is $J$ (that is, the all-1 vector). As an application of our work, we prove that every signed bipartite $K_4$-minor-free graph of unbalanced-girth $2k$ admits a homomorphism to $SPC(2k)$. This supports a conjecture of Guenin claiming that every signed bipartite planar graph of unbalanced-girth $2k$ admits a homomorphism to $SPC(2k)$ (this would be an extension of the four-color theorem). We also give an application of our work to edge-coloring $2k$-regular $K_4$-minor-free multigraphs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Laurent Beaudou, Florent Foucaud, Reza Naserasr. 2019-05-28. Homomorphism bounds of signed bipartite $K_4$-minor-free graphs and edge-colorings of $2k$-regular $K_4$-minor-free multigraphs. https://doi.org/10.1016/j.dam.2018.09.004

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

KEEP EXPLORING

Related papers

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

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