Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds

TL;DR

This paper characterizes minimal non-word-representable graphs, explores cover number bounds by comparability graphs, and identifies subclasses with tight bounds, advancing understanding of word-representable graph properties.

Contribution

It precisely classifies minimal non-word-representable graphs, solves an open problem on cover number bounds, and identifies subclasses with bounded cover numbers.

Findings

Complete description of minimal non-word-representable graphs with an all-adjacent vertex.

Existence of word-representable graphs with cover number Ω(log n), matching the upper bound.

For triangle-free circle graphs, the cover number by comparability graphs is at most 3, and this is tight.

Abstract

Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs. Both classes are hereditary and admit characterizations in terms of minimal forbidden induced subgraphs. While the minimal forbidden induced subgraphs for comparability graphs are completely characterized, the corresponding characterization for word-representable graphs remains open. In this paper, we precisely determine which minimal non-comparability graphs are also minimal non-word-representable graphs by classifying minimal non-comparability graphs according to whether they are word-representable. As a consequence, we provide a complete description of minimal non-word-representable graphs containing an all-adjacent vertex. We also address an open problem posed by Kenkireth et al.\ concerning the cover number of word-representable graphs by comparability graphs. We demonstrate the existence of word-representable graphs on $n$ vertices whose cover number by comparability graphs is $\Omega(\log n)$, which establishes that the universal $O(\log n)$ upper bound is asymptotically tight for the class of word-representable graphs. For triangle-free circle graphs, we establish that the cover number by comparability graphs is at most $3$ and demonstrate that this bound is tight. More generally, we prove that for any circle graph $G$ with clique number $\omega(G) \ge 24$, the cover number by comparability graphs is at most $2$. Finally, we identify four subclasses of word-representable graphs for which the cover number by comparability graphs of every graph in these classes is at most $2$.