Safe’s Matrix Recognition Framework

• The paper introduces a linear-time framework that characterizes forbidden configurations in binary matrices via the circular-ones and circularly compatible ones properties.
• It details key operations like row-complementation and configuration-equivalence to systematically enforce structural properties within co-bipartite graphs.
• The framework unifies matrix-theoretic and graph-theoretic methods, yielding efficient algorithms for recognizing semi-transitive orientations and word-representable graphs.

Safe’s Matrix Recognition Framework is a structural and algorithmic approach for recognizing properties of binary matrices—particularly “circular-ones-type” properties—via the identification of forbidden configurations. This framework provides a unified methodology that enables linear-time recognition algorithms and supports the structural study of various matrix classes, most notably in the characterization of word-representable co-bipartite graphs, by connecting matrix-theoretic properties to graph orientation properties (Srinivasan et al., 13 Dec 2025).

1. Foundational Concepts: Configurations and Matrix Operations

A key construct in Safe’s framework is the containment of configurations. For a binary $m\times n$ matrix $M = (m_{ij})$ and a smaller binary matrix $N$, $M$ contains $N$ as a configuration if some $p$ distinct rows and $q$ distinct columns form a submatrix equivalent to $N$ up to arbitrary row and column permutations. Two matrices are configuration-equivalent if each contains the other as a configuration.

Row-complementation is fundamental: given a binary mask $a \in \{0,1\}^m$, the matrix $aM$ is formed by complementing each row $i$ of $M$ whenever $a_i = 1$. The operation $M^*$ denotes $M$ with a single all-zero column appended to the right. These notions underpin the systematic search for substructures violating targeted matrix properties.

2. Forbidden Configuration Characterization

Safe’s master theorem asserts that, for any circular-ones-type matrix property $P$, there exists a (finite or infinite) family $\mathcal{F}$ of forbidden matrices such that a matrix $M$ possesses property $P$ if and only if it contains no member of $\mathcal{F}$ as a configuration. Critically, if all forbidden matrices are of constant size, one can design a linear-time recognition algorithm that either constructs a witness (such as an ordering) certifying $P$, or finds an explicit obstruction (Srinivasan et al., 13 Dec 2025).

This approach leverages the following structure:

Term	Description
Configuration	Pattern-matching up to row/col permutations
Row-complementation	Flipping entries of specified rows using a binary mask
Configuration-equivalence	Bidirectional containment as configurations

3. The Circularly Compatible Ones Property

In the context of co-bipartite graphs, the matrix property corresponding to semi-transitivity is the circularly compatible ones property. For a binary $m\times n$ matrix $M$ with row index set $R = \{r_1, \dots, r_m\}$ and column index set $C = \{c_1, \dots, c_n\}$, $M$ has the circularly compatible ones property if there exist:

• A linear order $\preccurlyeq_r$ on $R$ and $\preccurlyeq_c$ on $C$.
• For every row $r$, the set of columns with ones forms a circular interval in $(C, \preccurlyeq_c)$.
• Dually, for every column $c$, the set of rows with ones forms a circular interval in $(R, \preccurlyeq_r)$.
• The left and right endpoints of these intervals, ordered by the row sequence, form sequences that are circularly monotone.

A circular interval on $C$ is, relative to a fixed linear order, an interval that may “wrap around” the set (i.e., the union of two terminal intervals if needed).

Safe demonstrates (Theorem 4.7) the following equivalence for any $m \times n$ binary matrix $M$:

1. $M$ has the circularly compatible ones property.
2. $M$ contains no member of the infinite forbidden family $CCO^\infty$ as a configuration.
3. $M$ has the circular-ones property on both rows and columns and avoids a finite core obstruction list $CCO$.
4. $M$ satisfies the doubly $D$-circular property (a purely interval-ordering condition).

$CCO^\infty$ consists of four constant-size obstructions ($Z_2^*$, $Z_3^*$, $Z_4^*$, $Z_5$; each at most $4\times 5$), and two infinite families $\{k^*: k \geq 3\}$ and $\{\overline{k}^*: k \geq 3\}$; $k^*$ is the $k\times (k+1)$ matrix where each row is all 1's except for a cyclically positioned 0, and $\overline{k}^*$ is the row-complement.

4. Linear-Time Recognition Algorithm

Theorem 4.8 of Safe’s work provides a recognition algorithm for circularly compatible ones in $O(\mathrm{size}(M))$ time, where:

$\mathrm{size}(M) = m + n + \#\text{1's in }M.$

The algorithm comprises:

• Input: $m \times n$ binary matrix $M$ in sparse list-of-ones format.
• Process: Attempt to find a circularly compatible biorder $(\preccurlyeq_r, \preccurlyeq_c)$ or a forbidden configuration $F \in CCO^\infty$ in $M$.
• Output: The biorder if the property holds, or an explicit forbidden submatrix certifying failure.

Application to co-bipartite graphs: For a co-bipartite graph $G = (X, Y)$, form its bipartite adjacency matrix $M(G)$; execute Safe’s algorithm. Its linear complexity $O(n + m)$ follows since building $M$ requires $O(n + m)$ and the subroutine is linear in matrix size.

Correctness is established as: $G$ is semi-transitive $\Leftrightarrow$ $M(G)$ has the circularly compatible ones property $\Leftrightarrow$ Safe's subroutine identifies a biorder rather than a forbidden $F$.

5. Connection to Word-Representable Co-bipartite Graphs

Safe’s matrix recognition framework is central to the forbidden subgraph characterization of word-representable co-bipartite graphs, a subclass where the vertex set partitions into two cliques. In this setting, semi-transitivity of the graph aligns precisely with the circularly compatible ones property on its bipartite adjacency matrix. Thus, the structural and algorithmic results for matrices translate directly into graph-theoretic criteria and algorithms (Srinivasan et al., 13 Dec 2025).

An explicit workflow for recognizing semi-transitive co-bipartite graphs is:

1. Partition $G$ into cliques $X$ and $Y$.
2. Form $M(G)$; $M_{ij}=1$ iff $x_i$ adjacent to $y_j$.
3. Run Safe's subroutine on $M(G)$.
4. If a biorder is returned, $G$ is semi-transitive; otherwise, the forbidden configuration corresponds to a minimal forbidden word-representable subgraph.

6. Illustrative Examples

To demonstrate the framework’s operation, consider the following cases:

• Example 4.1: $G$ with $X=\{r_1, r_2\}$, $Y=\{c_1, c_2\}$ and edges $r_1c_1, r_1c_2, r_2c_2$. Its adjacency matrix

$$M(G) = \begin{pmatrix} 1 & 1 \ 0 & 1 \end{pmatrix}$$

satisfies the circularly compatible ones property with natural row and column orders, so the algorithm returns the biorder.

• Example 4.2: $G$ with $X=\{r_1, r_2, r_3\}$, $Y=\{c_1, c_2, c_3\}$ and edges $r_1c_1, r_1c_2, r_2c_2, r_2c_3, r_3c_1, r_3c_3$, leading to

$$M(G) = \begin{pmatrix} 1 & 1 & 0 \ 0 & 1 & 1 \ 1 & 0 & 1 \end{pmatrix}.$$

Safe’s subroutine identifies the forbidden $3^*$ pattern in $CCO^\infty$, so the algorithm outputs a certificate of non-semi-transitivity, corresponding to the minimal forbidden subgraph $\overline{C_6}$.

7. Broader Context and Significance

Safe’s matrix recognition framework synthesizes matrix-theoretic and graph-theoretic perspectives, providing a general strategy for aligning structural properties with concise forbidden configuration principles. The linear-time recognition algorithm marks a significant advance in algorithmic graph theory, especially for subclasses such as co-bipartite and permutation graphs. Its connections with word-representable graphs, semi-transitive orientations, and forbidden subgraph theory unify disparate strands in combinatorics and algorithm design (Srinivasan et al., 13 Dec 2025).

A plausible implication is that similar forbidden configuration frameworks may be extended to other matrix and graph classes exhibiting circular or interval-based structural constraints, supporting efficient recognition and classification.