arXiv:2603.29629 · v6

On graph products and multi-word-representability

首次提交 2026-03-31 19:52

版本更新 2026-11-12 19:47

雷达观测 2026-11-13 14:15

摘要

The multi-word-representation number $μ(G)$ is the minimum number of word-representable graphs whose union is $G$. We investigate $μ(H)$ for graph products $H$ obtained from $G_1$ and $G_2$ via six fundamental products: lexicographic, Cartesian, rooted, corona, tensor, and strong. We prove $μ(H) = \max\{μ(G_1), μ(G_2)\}$ for Cartesian and rooted products. For the corona product, we show $\max\{μ(G_1), μ(G_2)\} \le μ(H) \le \max\{μ(G_1), μ(G_2)\} + 1$, and show that the lower bound is tight when $μ(G_1) > μ(G_2)$ or $G_2$ admits a covering by $μ(G_2)$ word-representable graphs, one of which is a comparability graph. For the lexicographic product, we show $\max\{μ(G_1), μ(G_2)\} \le μ(H) \le μ(G_1) + μ(G_2)$, and show that the lower bound is tight when $\mathrm{cov}_{\mathrm{comp}}(G_2) \le \max\{μ(G_1), μ(G_2)\}$. We provide logarithmic bounds for tensor and strong products. We prove $G^{[k]}$ is word-representable if and only if $G$ is a comparability graph. We establish bounds $μ(G^{[k]}) \le \mathrm{cov}_{\mathrm{comp}}(G)$ and $μ(G^{[k]}) \le k$ for non-comparability word-representable graphs. Using lexicographic powers, we obtain the sublinear bound $τ(n) \le n^{\log_8 6+ε}$ for the extremal function $τ(n)$. Finally, we address the Word-representable Bipartition (WB) problem, proving a negative answer for $n \geq 433$: showing that for every such $n$, there exists a graph of order $n$ that cannot be vertex-partitioned into two word-representable induced subgraphs.