# Skew partition

In graph theory, a skew partition of a graph is a partition of its vertices into two subsets, such that the induced subgraph formed by one of the two subsets is disconnected and the induced subgraph formed by the other subset is the complement of a disconnected graph. Skew partitions play an important role in the theory of perfect graphs.

## Definition

A skew partition of a graph $G$ is a partition of its vertices into two subsets $X$ and $Y$ for which the induced subgraph $G[X]$ is disconnected and the induced subgraph $G[Y]$ is the complement of a disconnected graph (co-disconnected). Equivalently, a skew partition of a graph $G$ may be described by a partition of the vertices of $G$ into four subsets $A$, $B$, $C$, and $D$, such that there are no edges from $A$ to $B$ and such that all possible edges from $C$ to $D$ exist; for such a partition, the induced subgraphs $G[A\cup B]$ and $G[C\cup D]$ are disconnected and co-disconnected respectively, so we may take $X=A\cup B$ and $Y=C\cup D$.

## Examples

Every path graph with four or more vertices has a skew partition, in which the co-disconnected set $Y$ is one of the interior edges of the path and the disconnected set $X$ consists of the vertices on either side of this edge. However, it is not possible for a cycle graph of any length to have a skew partition: no matter which subsets of the cycle are chosen as the set $X$, the complementary set $Y$ will have the same number of connected components, so it is not possible for $X$ to be disconnected and $Y$ to be co-disconnected.
If a graph has a skew partition, so does its complement. For instance, the complements of path graphs have skew partitions, and the complements of cycle graphs do not.

## Special cases

If a graph is itself disconnected, then with only three simple exceptions (an empty graph, a graph with one edge and three vertices, or a four-vertex perfect matching) it has a skew partition, in which the co-disconnected side of the partition consists of the endpoints of a single edge and the disconnected side consists of all other vertices. For the same reason, if the complement of a graph is disconnected, then with a corresponding set of three exceptions it must have a skew partition.
If a graph has a clique separator (a clique whose removal would disconnect the remaining vertices) with more than one vertex, then the partition into the clique and the remaining vertices forms a skew partition. A clique cutset with one vertex is an articulation point; if such a vertex exists, then with a small number of simple exceptions, there is a skew partition in which the co-disconnected side consists of this vertex and one of its neighbors.
A star cutset in a graph $G$ is a vertex separator in which one of the separator vertices is adjacent to all the others. Every clique separator is a star cutset. Necessarily, a graph with a star cutset (with more than one vertex) has a skew partition in which the co-disconnected subgraph consists of the vertices in the star cutset and the disconnected subgraph consists of all the remaining vertices.
A module (or homogeneous set) is a nontrivial subset $H$ of the vertices of $G$ such that, for every vertex $v$ that is not in $H$, either $v$ is adjacent to all vertices in $H$ or to none of them. If a graph $G$ has a module $H$ and, outside it, there exist both vertices adjacent to all vertices in $H$ and other vertices adjacent to none of them, then $G$ has a star cutset consisting of one vertex in the module together with its neighbors outside the module. On the other hand, if there exists a module in which one of these two subsets is empty, then the graph is disconnected or co-disconnected and again (with the three simple exceptions) it has a skew cutset.

## History

Skew partitions were introduced by Chvátal (1985), in connection with perfect graphs. Chvátal proved that a minimally imperfect graph could not have a star cutset. Trivially, disconnected graphs cannot be minimally imperfect, and it was also known that graphs with clique separators or modules could not be minimally imperfect. Claude Berge had conjectured in the early 1960s that perfect graphs were the same as the Berge graphs, graphs with no induced odd cycle (of length five or more) or its complement, and (because cycles and their complements do not have skew partitions) no minimal non-Berge graph can have a skew partition. Motivated by these results, Chvátal conjectured that no minimally imperfect graph could have a skew partition. Several authors proved special cases of this conjecture, but it remained unsolved for many years.
Skew partitions gained significance when they were used by Chudnovsky et al. (2006) to prove the strong perfect graph theorem that the Berge graphs are indeed the same as the perfect graphs. Chudnovsky et al. were unable to prove Chvátal's conjecture directly, but instead proved a weaker result, that a minimal counterexample to the theorem (if it existed) could not have a balanced skew partition, a skew partition in which every induced path with endpoints on one side of the partition and interior vertices on the other side has even length. This result formed a key lemma in their proof, and the full version of Chvátal's lemma follows from their theorem.

## In structural graph theory

Skew partitions form one of the key components of a structural decomposition of perfect graphs used by Chudnovsky et al. (2006) as part of their proof of the strong perfect graph theorem. Chudnovsky et al. showed that every perfect graph either belongs to one of five basic classes of perfect graphs, or it has one of four types of decomposition into simpler graphs, one of which is a skew partition.
A simpler example of a structural decomposition using skew partitions is given by Seymour (2006). He observes that every comparability graph is complete, is bipartite, or has a skew partition. For, if every element of a partially ordered set is either a minimal element or a maximal element, then the corresponding comparability graph is bipartite. If the ordering is a total order, then the corresponding comparability graph is complete. If neither of these two cases arise, but every element that is neither minimal nor maximal is comparable to all other elements, then either the partition into the minimal and non-minimal elements (if there is more than one minimal element) or the partition into the maximal and non-maximal elements (if there is more than one maximal element) forms a star cutset. And in the remaining case, there exists an element $x$ of the partial order that is not minimal, not maximal, and not comparable with all other elements; in this case, there is a skew partition (the complement of a star cutset) in which the co-disconnected side consists of the elements comparable to $x$ (not including $x$ itself) and the disconnected side consists of the remaining elements.
The chordal graphs have an even simpler decomposition of a similar type: they are either complete or they have a clique separator. Hayward (1985) showed, analogously, that every connected and co-connected weakly chordal graph (a graph with no induced cycle or its complement of length greater than four) with four or more vertices has a star cutset or its complement, from which it follows by Chvátal's lemma that every such graph is perfect.

## Algorithms and complexity

A skew partition of a given graph, if it exists, may be found in polynomial time. This was originally shown by de Figueiredo et al. (2000) but with an impractically large running time of $O(n^{101})$, where $n$ is the number of vertices in the input graph. Kennedy & Reed (2008) improved the running time to $O(n^{4}m)$; here $m$ is the number of input edges.
It is NP-complete to test whether a graph contains a skew partition in which one of the parts of the co-disconnected side is independent. Testing whether a given graph contains a balanced skew partition is also NP-complete in arbitrary graphs, but may be solved in polynomial time in perfect graphs.