Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1909.00371

Signified chromatic number of grids is at most 9

Janusz Dybizbanski
View original source ↗Read source document ↗Export metadata ↓

Abstract

A signified graph is a pair $(G, Σ)$ where $G$ is a graph, and $Σ$ is a set of edges marked with '$-$'. Other edges are marked with '$+$'. A signified coloring of the signified graph $(G, Σ)$ is a homomorphism into a signified graph $(H, Δ)$. The signified chromatic number of the signified graph $(G, Σ)$ is the minimum order of $H$. In this paper we show that for every 2-dimensional grid $(G, Σ)$ there exists homomorphism from $(G, Σ)$ into the signed Paley graphs $SP_9$. Hence signified chromatic number of the signified grids is at most 9. This improves upper bound on this number obtained recently by Bensmail.

Explore related subjects

cs.DMmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Janusz Dybizbanski. 2019-09-01. Signified chromatic number of grids is at most 9. https://doi.org/10.1007/s00373-020-02155-y

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

KEEP EXPLORING

Related papers

arXiv2026

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM↗
arXiv2026

Three Hardness Results for Graph Similarity Problems

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance $δ_{\mathcal{E}}$, and the metrics arising from $\ell_p$-operator norms, which we denote by $δ_p$ and $δ_{|p|}$. We address the following question: can these measures of similarity be used to design polynomial-time approximation algorithms for graph isomorphism? We show that computing an optimal value of $δ_{\mathcal{E}}$ is \NP-hard on pairs of graphs with the same number of edges. In addition, we show that computing optimal values of $δ_p$ and $δ_{|p|}$ is \NP-hard even on pairs of $1$-planar graphs with the same degree sequence and bounded degree. These two results improve on previous known ones, which did not examine the restricted case where the pairs of graphs are required to have the same number of edges. Finally, we study similarity problems on strongly regular graphs and prove some near optimal inequalities with interesting consequences on the computational complexity of graph and group isomorphism.

cs.DM↗