---
title: Half Graph in Graph Theory
url: https://www.emergentmind.com/topics/half-graph-f2780969-e5e6-4769-98e7-b560f923db52
type: topic
---

# Half Graph in Graph Theory

In graph theory and model theory, a **half graph** is a canonical ordered bipartite pattern that encodes a total order through nested neighborhoods. One standard formulation uses disjoint vertex sets \(A=\{a_1,\ldots,a_t\}\) and \(B=\{b_1,\ldots,b_t\}\) with adjacency rule \(a_i b_j\in E \iff i\leq j\); an equivalent convention used in the literature writes \((b_i,a_j)\in E \iff i<j\) after a shift of indexing conventions. In both forms, the pattern is distinguished from the matching and the co-matching, and it plays a central role in structural graph theory, parameterized complexity, stability theory, and the study of sparse graph powers [2602.07606][2103.06218].

## 1. Canonical ordered pattern

The half-graph is introduced together with two companion bipartite patterns. Given two disjoint sets
\[
A=\{a_1,\ldots,a_t\}, \qquad B=\{b_1,\ldots,b_t\},
\]
the matching is defined by
\[
a_i b_j\in E \iff i=j,
\]
the co-matching by
\[
a_i b_j\in E \iff i\neq j,
\]
and the half-graph by
\[
a_i b_j\in E \iff i\leq j.
\]
This makes the half-graph the “order” pattern: vertices on one side have nested neighborhoods into the other side [2602.07606].

A related formulation appears in the study of sparse graph powers. There, distinct vertices
\[
a_1,\dots,a_\ell,\; b_1,\dots,b_\ell
\]
form a half graph, also called a **ladder**, of order \(\ell\) if
\[
(b_i,a_j)\in E \iff i<j \qquad \text{for all } i,j\in[\ell].
\]
The same source distinguishes half graphs from **semi-ladders**, where only the implications for \(i<j\) and the non-edges on the diagonal are required, and from **co-matchings**, which satisfy \((b_i,a_j)\in E \iff i\ne j\) [2103.06218].

These definitions emphasize the same structural feature: a half graph is a bipartite adjacency pattern that realizes monotone comparability by index. This is why it is repeatedly treated as a canonical obstruction or witness of order-like behavior.

## 2. Semi-induced containment and half-graph index

In parameterized and structural graph theory, half-graphs are often studied through the weaker notion of **semi-induced** containment. A bipartite graph \(H\) appears semi-induced in a graph \(G\) if there exist \(A,B\subseteq V(G)\) such that the bipartite subgraph between \(A\) and \(B\) is isomorphic to \(H\). Only the cross-edges matter; edges inside \(A\) and inside \(B\) are irrelevant [2602.07606].

This leads to the **half-graph index** of a graph \(G\): the maximum order of a semi-induced half-graph in \(G\). Analogously one defines the matching index and co-matching index. For a graph class, having bounded half-graph index means that there exists a constant \(h\) such that every graph in the class has half-graph index at most \(h\); the same source also says such classes are **half-graph-free**. Unbounded half-graph index means that for every \(t\) there exists a graph in the class containing a semi-induced half-graph of order \(t\) [2602.07606].

A theorem of Ding, Oporowski, Oxley, and Vertigan is the structural starting point for this viewpoint. In the form used in recent complexity work, there exists a function \(Q:\mathbb N\to\mathbb N\) such that every bipartite graph without twins and with at least \(Q(h)\) vertices on one side contains a matching, co-matching, or half-graph of order \(h\) as an induced subgraph. Via neighborhood diversity and twin classes, this yields a corresponding trichotomy for general graphs: sufficiently large neighborhood diversity forces large matching index, co-matching index, or half-graph index [2602.07606].

An important symmetry is that half-graph-freeness is preserved under complementation: a class \(C\) is half-graph-free if and only if its complement class \(\overline C\) is half-graph-free. By contrast, matching-free and co-matching-free are exchanged by complementation [2602.07606].

## 3. Complexity taxonomy and algorithmic consequences

The boundedness or unboundedness of the matching, co-matching, and half-graph indices partitions graph classes into \(2^3=8\) cases. Recent work uses this taxonomy to classify the parameterized complexity of **Independent Set**, **Clique**, and **Dominating Set** across all eight cases [2602.07606].

The main positive result involving half-graphs is that **Independent Set** is fixed-parameter tractable on classes with both bounded half-graph index and bounded co-matching index. Formally, there exists a computable function \(H(t,k)\) such that, for every \(t\), given an \(n\)-vertex graph \(G\) with half-graph index \(<t\) and co-matching index \(<t\), one can decide whether \(G\) contains an independent set of size at least \(k\) in time \(H(t,k)\cdot n^2\) [2602.07606].

The same paper shows that bounded half-graph index alone is not sufficient for such tractability. It constructs a graph class with half-graph index at most \(256\) on which **Independent Set** is W[1]-hard, and another graph class with half-graph index at most \(16\) on which **Dominating Set** is W[1]-hard. These results are used to show that excluding half-graphs alone is structurally meaningful but still too weak to force fixed-parameter tractability for the main problems under study [2602.07606].

Half-graph boundedness nonetheless supports approximation. For a graph \(G\) with half-graph index \(h\) and maximum independent-set size \(k\), there is an algorithm running in time \(O(n^{2h+2})\) that finds an independent set of size at least \(k^{1/h}\). This is a direct algorithmic use of the half-graph parameter without the additional assumption of bounded co-matching index [2602.07606].

The complement symmetry of the half-graph parameter also propagates immediately to **Clique** results, because Clique on \(G\) is Independent Set on \(\overline G\) and half-graph-freeness is complement-invariant [2602.07606].

## 4. Half graphs in powers of sparse graphs

Half graphs remain central when adjacency is defined by bounded distance rather than by direct edges. For a graph \(G\) and integer \(d\ge 1\), the \(d\)-th power \(G^d\) is defined by
\[
V(G^d)=V(G),\qquad E(G^d)=\{(u,v)\mid \operatorname{dist}_G(u,v)\le d\}.
\]
A distance-\(d\) half graph is then a sequence of vertices satisfying
\[
\operatorname{dist}_G(b_i,a_j)\le d \iff i<j,
\]
which is exactly a half graph in \(G^d\) [2103.06218].

This setting connects half graphs to sparsity theory. Adler and Adler proved that nowhere dense classes are stable, hence every fixed first-order interpretation has bounded half-graph order. In the distance setting, this implies that for every nowhere dense class \(C\) and every \(d\), the graphs in \(C^d\) have bounded half-graph order. Fabiański et al. later showed boundedness of semi-ladders in \(C^d\), which is stronger in the distance setting. The later quantitative work emphasizes that the earlier bounds were either non-constructive or very loose [2103.06218].

For this reason, recent results provide nearly tight asymptotic lower and upper bounds on the maximum order of half graphs in powers of several sparse classes: planar graphs, graphs with bounded maximum degree, graphs with bounded pathwidth or treewidth, and graphs excluding a fixed clique as a minor. For planar graphs, the cited work highlights an improvement from a previous bound of order \(d^{O(d^6)}\) to \(d^{O(d)}\), using structural graph-theoretic analysis of semi-ladders through the notion of **cages**, together with a new structural result yielding a fully polynomial bound on neighborhood complexity in planar graphs [2103.06218].

For graphs of maximum degree at most \(\Delta\), the behavior is essentially exponential in \(d\). For every \(\Delta\ge 4\) and odd \(d\ge 1\), there exists a graph of maximum degree at most \(\Delta\) containing a distance-\(d\) half graph of order
\[
\Big\lfloor \frac{\Delta}{2}\Big\rfloor^{\lceil d/2\rceil}.
\]
In the same class, the upper bound recorded in the summary is
\[
\Delta^d+1.
\]
Thus, for bounded-degree graphs, the maximum half-graph order in graph powers is pinned down up to constant factors in the exponent [2103.06218].

## 5. Stability, indiscernibility, and regularity phenomena

The half-graph is also important because its absence is tied to stability. Recent complexity work explicitly notes that “the half-graph pattern has strong ties to model theory, where its absence characterizes stable theories” [2602.07606]. The sparse-graph-power literature makes the same connection in a different language by recalling the stability of nowhere dense classes and the boundedness of half graphs in their distance powers [2103.06218].

This model-theoretic perspective becomes algorithmic through indiscernible sequences. One result states that if \(G\) has half-graph index \(<t\), and
\[
I=(v_1,\dots,v_n)
\]
is a \(\{\chi_{2t},\chi_{2t}^\star\}\)-indiscernible sequence of length \(n\ge 4t\), then every vertex \(w\in V(G)\setminus I\) satisfies
\[
|N(w)\cap I|<2t \qquad\text{or}\qquad |I\setminus N(w)|<2t.
\]
The paper interprets this as a “few neighbors or few non-neighbors” dichotomy forced by bounded half-graph index [2602.07606].

A stronger statement adds bounded co-matching index. If \(G\) has half-graph index \(<t\) and co-matching index \(<t\), and \(I\) is a \(\Gamma_t\)-indiscernible sequence of length \(n\ge 8t+1\), then for every \(w\in V(G)\setminus I\),
\[
|N(w)\cap I|<2t \qquad\text{or}\qquad I\subseteq N(w).
\]
In the authors’ interpretation, bounded half-graph index gives “few neighbors or few non-neighbors,” and bounded co-matching index upgrades “few non-neighbors” to “no non-neighbors” [2602.07606].

These regularity statements drive the kernelization for Independent Set. They also clarify why the half-graph matters most in tandem with the co-matching: the pair defines the regime in which long sequences exhibit sharply constrained neighborhood behavior, while half-graph-freeness by itself remains too weak to eliminate hard instances [2602.07606].

## 6. Terminological extensions and distinct notions

Although “half graph” has a standard meaning in combinatorics, the same phrase or nearby terminology is used differently in other literatures.

In self-supervised graph representation learning, **Pairwise Half-graph Discrimination** defines a “half-graph” as one of two induced parts obtained by splitting a graph into two disconnected pieces. The split is node-based, approximately balanced, and produced by choosing a border node; positive examples are pairs of half-graphs from the same source graph, while negative examples replace one half by a half-graph from another graph [2110.13567]. This usage is task-specific and not the classical ordered bipartite half-graph.

Several papers explicitly warn against conflating the classical half-graph with nearby terms. Work on **half-squares** of bipartite graphs states that it is not about the classical half-graph, but about the operation \(B\mapsto B^2[X]\) or \(B^2[Y]\) on a bipartite graph \(B=(X,Y,E)\) [1804.05793]. Likewise, work on **half-regular bipartite graphs** stresses that it studies half-regularity—constant degree on one side of a bipartition—rather than the chain-graph object usually called a half graph [1602.04316].

Outside graph theory proper, the overlap is purely terminological. In quantum-walk theory, a graph with joined half lines \(\mathbb{J}_\kappa\) is a star of \(\kappa\) semi-infinite rays meeting at one origin and is described as a “joined-half-lines” or “star-like half-line graph,” not as the standard combinatorial half graph [1009.1306]. In geometric analysis, titles involving “graphs in a half-space” or “CMC \(1/2\) entire graphs” concern hypersurfaces or sections over geometric domains rather than graph-theoretic half graphs [1303.3729][2606.01715].

The resulting picture is therefore two-layered. In the classical sense, the half graph is an ordered bipartite obstruction encoding a total order and governing stability, sparse-graph structure, and parameterized complexity. In broader usage, the term may denote entirely different constructions, and those usages must be disambiguated from the classical object.

Source: https://www.emergentmind.com/topics/half-graph-f2780969-e5e6-4769-98e7-b560f923db52