Walk-powers and homomorphism bound of planar graphs

TL;DR

This paper investigates homomorphisms of planar graphs with high odd-girth to specific target graphs, establishing optimality conditions using walk-power concepts and extending results to bipartite signed planar graphs.

Contribution

It proves that under the conjecture, certain target graphs are optimal for homomorphisms from high odd-girth planar graphs, using walk-power and clique number techniques.

Findings

If the conjecture holds, $PC_{2k}$ is optimal for homomorphisms from high odd-girth planar graphs.

Established bounds on the number of vertices and edges for such target graphs.

Extended results to bipartite signed planar graphs with unbalanced-girth $2k$.

Abstract

As an extension of the Four-Color Theorem it is conjectured that every planar graph of odd-girth at least $2k+1$ admits a homomorphism to $PC_{2k}=(\mathbb{Z}_2^{2k}, \{e_1, e_2, ...,e_{2k}, J\})$ where $e_i$'s are standard basis and $J$ is all 1 vector. Noting that $PC_{2k}$ itself is of odd-girth $2k+1$, in this work we show that if the conjecture is true, then $PC_{2k}$ is an optimal such a graph both with respect to number of vertices and number of edges. The result is obtained using the notion of walk-power of graphs and their clique numbers. An analogous result is proved for bipartite signed planar graphs of unbalanced-girth $2k$. The work is presented on a uniform frame work of planar consistent signed graphs.