Half Graph in Graph Theory

Updated 6 July 2026

Half graph is an ordered bipartite graph where edge aᵢbⱼ exists if and only if i≤j, encoding a strict total order via its triangular adjacency.
It is applied to examine order patterns in sparse graph classes and graph powers, providing quantitative measures of order-like behavior in dense projections.
Multiple definitions of 'half graph' exist, including its use in Eulerian subgraphs and half-squares, making precise disambiguation essential in graph theory.

Searching arXiv for recent and foundational papers on “half graph” and related graph-theoretic usages. Search query: half graph graph theory arXiv ordered bipartite half-graph semi-ladder co-matching In graph theory, the standard named half graph is the ordered bipartite graph $H_t$ on two disjoint vertex sets $A=\{a_1,\ldots,a_t\}$ and $B=\{b_1,\ldots,b_t\}$ with adjacency

$a_i b_j\in E \iff i\le j,$

or, in an equivalent convention, $i<j$ (Dreier et al., 7 Feb 2026). In this sense a half graph is also called a ladder, and its bipartite adjacency matrix is triangular: the vertices $b_i$ see precisely the later vertices $a_j$ . This makes half graphs canonical order-encoding patterns in graphs (Sokołowski, 2021). The same phrase, however, is used in several different ways elsewhere in the literature—notably for degree-balanced subgraphs of Eulerian graphs, for half-squares of bipartite graphs, and in a variety of “half-” constructions that are terminologically related but structurally distinct (Csikvári et al., 2019, Le et al., 2018, Aksen et al., 2016).

1. Classical ordered bipartite half graph

For $\ell\ge 1$ , pairwise different vertices

$a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$

form a half graph of order $\ell$ if

$A=\{a_1,\ldots,a_t\}$ 0

The order is the integer $A=\{a_1,\ldots,a_t\}$ 1, equivalently the number of pairs $A=\{a_1,\ldots,a_t\}$ 2 or the length of either witnessing sequence (Sokołowski, 2021). In this form the half graph is one of several closely related bipartite patterns. The same sequences form a semi-ladder if $A=\{a_1,\ldots,a_t\}$ 3 for all $A=\{a_1,\ldots,a_t\}$ 4 and $A=\{a_1,\ldots,a_t\}$ 5 for all $A=\{a_1,\ldots,a_t\}$ 6, and a co-matching if $A=\{a_1,\ldots,a_t\}$ 7 (Sokołowski, 2021).

The half graph is therefore the most rigid of these patterns: it realizes a strict total order by adjacency. The index order $A=\{a_1,\ldots,a_t\}$ 8 can be read off from neighborhoods, which is why these objects are said to “encode total orders in graphs” (Sokołowski, 2021). In the parameterized-complexity literature the same object is written $A=\{a_1,\ldots,a_t\}$ 9, with

$B=\{b_1,\ldots,b_t\}$ 0

and is studied together with the matching $B=\{b_1,\ldots,b_t\}$ 1 and co-matching $B=\{b_1,\ldots,b_t\}$ 2 as one of three unavoidable bipartite patterns in large twin-free structures (Dreier et al., 7 Feb 2026).

This ordered bipartite meaning is the standard graph-theoretic one. It is also the sense most closely connected to structural graph theory, model-theoretic stability, and quantitative bounds in sparse graph classes.

2. Half graphs in graph powers and sparse classes

A major modern use of half graphs is in the study of graph powers. For a graph $B=\{b_1,\ldots,b_t\}$ 3 and integer $B=\{b_1,\ldots,b_t\}$ 4,

$B=\{b_1,\ldots,b_t\}$ 5

The corresponding distance- $B=\{b_1,\ldots,b_t\}$ 6 notion says that $B=\{b_1,\ldots,b_t\}$ 7 form a distance- $B=\{b_1,\ldots,b_t\}$ 8 half graph if

$B=\{b_1,\ldots,b_t\}$ 9

Thus ordinary half graphs in $a_i b_j\in E \iff i\le j,$ 0 are equivalent to distance- $a_i b_j\in E \iff i\le j,$ 1 half graphs in $a_i b_j\in E \iff i\le j,$ 2 (Sokołowski, 2021).

The central quantitative question is how large a half graph can occur in $a_i b_j\in E \iff i\le j,$ 3 when $a_i b_j\in E \iff i\le j,$ 4 belongs to a sparse class. The sharpest available asymptotic bounds currently depend strongly on the class:

Sparse class	Lower bound on maximum order	Upper bound
Maximum degree at most $a_i b_j\in E \iff i\le j,$ 5	$a_i b_j\in E \iff i\le j,$ 6	$a_i b_j\in E \iff i\le j,$ 7
Planar graphs	$a_i b_j\in E \iff i\le j,$ 8	$a_i b_j\in E \iff i\le j,$ 9
Pathwidth at most $i<j$ 0	$i<j$ 1	$i<j$ 2
Treewidth at most $i<j$ 3	$i<j$ 4	$i<j$ 5
Excluding $i<j$ 6 as a minor	$i<j$ 7	$i<j$ 8

These bounds were established with nearly tight asymptotics for several classes, especially for planar graphs, where the upper bound $i<j$ 9 substantially improves earlier generic nowhere-dense estimates (Sokołowski, 2021). The same work gives explicit constructions: for every $b_i$ 0, planar graphs contain distance- $b_i$ 1 half graphs of order $b_i$ 2; for every $b_i$ 3, $b_i$ 4, there is a graph of pathwidth at most $b_i$ 5 containing a distance- $b_i$ 6 half graph of order $b_i$ 7 (Sokołowski, 2021).

Conceptually, these results show that graph powers of sparse graphs may become dense without admitting arbitrarily large order patterns. The half graph remains a controlled obstruction, and its size becomes a quantitative measure of how much order-like behavior survives in a power.

3. Half-graph index and parameterized complexity

When half graphs are sought inside arbitrary graphs, the relevant containment notion is often semi-induced. A bipartite graph $b_i$ 8 appears semi-induced in a graph $b_i$ 9 if there exist disjoint sets $a_j$ 0 such that the bipartite subgraph between $a_j$ 1 and $a_j$ 2 is isomorphic to $a_j$ 3; edges inside $a_j$ 4 and inside $a_j$ 5 are ignored (Dreier et al., 7 Feb 2026). The half-graph index of $a_j$ 6 is then the maximum order of a semi-induced half graph in $a_j$ 7.

This index is studied jointly with the matching index and co-matching index. A theorem of Ding, Oporowski, Oxley, and Vertigan implies that sufficiently large twin-free graphs must contain a large matching, co-matching, or half graph as a semi-induced subgraph, so graph classes fall into eight regimes according to which of the three indices are bounded (Dreier et al., 7 Feb 2026). Half-graph-freeness is also self-dual under complementation: a class is half-graph-free if and only if its complement class is half-graph-free (Dreier et al., 7 Feb 2026).

The resulting complexity picture is mixed. On the positive side, Independent Set is fixed-parameter tractable on every graph class where the half-graph and co-matching indices are simultaneously bounded: if a graph has half-graph index $a_j$ 8 and co-matching index $a_j$ 9, one can decide whether it contains an independent set of size at least $\ell\ge 1$ 0 in time

$\ell\ge 1$ 1

for a computable function $\ell\ge 1$ 2 (Dreier et al., 7 Feb 2026). The underlying structural reason is a neighborhood dichotomy on long indiscernible sequences: bounded half-graph index forces every outside vertex to be almost sparse or almost dense on such a sequence, and bounded co-matching index upgrades “almost dense” to “complete” (Dreier et al., 7 Feb 2026).

On the negative side, bounded half-graph index alone does not imply exact fixed-parameter tractability. There exists a graph class with half-graph index at most $\ell\ge 1$ 3 on which Independent Set is W[1]-hard, and a class with half-graph index at most $\ell\ge 1$ 4 on which Dominating Set is W[1]-hard (Dreier et al., 7 Feb 2026). There is, however, a nontrivial approximation guarantee: given a graph $\ell\ge 1$ 5, there is an algorithm running in

$\ell\ge 1$ 6

that finds an independent set of size at least $\ell\ge 1$ 7, where $\ell\ge 1$ 8 is the half-graph index of $\ell\ge 1$ 9 and $a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 0 is the maximum independent-set size (Dreier et al., 7 Feb 2026).

These results place the half graph at a structural boundary. Its exclusion yields real regularity, but by itself it does not fully tame dense-graph complexity.

4. Distinct meanings of “half graph” in the literature

The phrase “half graph” is overloaded. Several arXiv papers use it in senses that are mathematically precise but unrelated to the ordered bipartite graph $a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 1.

Usage	Definition in the source	Source
Standard half graph	$a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 2 or $a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 3	(Dreier et al., 7 Feb 2026, Sokołowski, 2021)
Eulerian half graph	$a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 4 for all $a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 5	(Csikvári et al., 2019)
Half-square	$a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 6 for one color class $a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 7 of a bipartite graph $a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 8	(Le et al., 2018)
Half-regularity	One side of a bipartition has constant degree in each color class	(Aksen et al., 2016)
Half-translation-surface graph	Saddle connection graph, not a technical term “half graph”	(Pan, 2018)
Half-Space Proximal graph	A proximity graph used in instance-based learning	(Talamantes et al., 2021)

In the Eulerian setting, a half graph is a subgraph $a_1,\dots,a_\ell,\quad b_1,\dots,b_\ell$ 9 such that

$\ell$ 0

so the word “half” refers to splitting the incident edges evenly at every vertex. This is a degree-constrained spanning-subgraph problem, not the ordered bipartite pattern. The paper proves

$\ell$ 1

with equality if and only if $\ell$ 2 is bipartite, where $\ell$ 3 is the number of Eulerian orientations and $\ell$ 4 the number of such half graphs (Csikvári et al., 2019).

In the half-square setting, one starts with a bipartite graph $\ell$ 5 and forms the graph $\ell$ 6 on one color class $\ell$ 7, joining two vertices when they have a common neighbor in $\ell$ 8. This notion yields exact characterizations: half-squares of biconvex bipartite graphs are exactly unit interval graphs, half-squares of convex bipartite graphs are exactly interval graphs, and half-squares of chordal bipartite graphs are exactly strongly chordal graphs (Le et al., 2018).

The paper on half-regular factorizations studies edge-colored bipartite graphs in which all vertices on one fixed side have the same degree in each color class; it explicitly states that this is different from the standard extremal/comparability-theoretic half graph (Aksen et al., 2016). Likewise, the paper on half-translation surfaces explicitly says that it does not use “half graph” as a technical term; its relevant object is the saddle connection graph of a half-translation surface (Pan, 2018).

Half graphs are closely tied to several neighboring concepts. Every half graph is a semi-ladder, and every co-matching is a semi-ladder; conversely, Ramsey-theoretic arguments show that simultaneous bounds on half graphs and co-matchings imply bounds on semi-ladders (Sokołowski, 2021). This makes the half graph one endpoint of a small hierarchy of order-pattern obstructions.

From the model-theoretic side, the half graph has a distinguished status: its absence characterizes stability, and monadically stable graph classes are those in which first-order definable relations with colors are half-graph-free (Dreier et al., 7 Feb 2026). In this role the half graph is not merely a forbidden subgraph but a canonical witness that adjacency can simulate linear order.

A different balance phenomenon appears in the Eulerian usage. There the “half graph” is really an $\ell$ 9-factor with

$A=\{a_1,\ldots,a_t\}$ 00

and the comparison with Eulerian orientations is exact on bipartite graphs: $A=\{a_1,\ldots,a_t\}$ 01 The same paper derives convolution identities

$A=\{a_1,\ldots,a_t\}$ 02

and an exact formula for the bipartite double cover

$A=\{a_1,\ldots,a_t\}$ 03

(Csikvári et al., 2019).

This suggests two recurrent uses of “half” in graph-theoretic language. One is order-theoretic, exemplified by the triangular adjacency of the standard half graph. The other is balance-theoretic, exemplified by equal splitting of incidences in Eulerian graphs. The two meanings are mathematically unrelated despite the shared terminology.

6. Terminological boundaries and common confusions

Several additional papers employ “half” language in ways that are adjacent to, but not instances of, the standard half graph. The graph formulation of Frankl’s union-closed sets conjecture studies vertices belonging to at most half of all maximal stable sets; it does not study the named half-graph class, although it works heavily with bipartite graphs and half-threshold counting statements (Bruhn et al., 2012). In extremal combinatorics, “sparse halves” of triangle-free graphs are vertex subsets of size $A=\{a_1,\ldots,a_t\}$ 04 spanning at most $A=\{a_1,\ldots,a_t\}$ 05 edges; again, this is unrelated to $A=\{a_1,\ldots,a_t\}$ 06 (Norin et al., 2013). Quantum-walk papers on graphs with joined half lines analyze a star-like graph built from several semi-infinite paths sharing one origin, which is a different use of “half” arising from half-lines rather than order patterns (Chisaki et al., 2010).

The Half-Space Proximal graph is another unrelated example. It is a local proximity graph used for parameter-free instance-based learning: starting from a center $A=\{a_1,\ldots,a_t\}$ 07, one repeatedly keeps the nearest remaining point $A=\{a_1,\ldots,a_t\}$ 08 and removes every candidate $A=\{a_1,\ldots,a_t\}$ 09 satisfying

$A=\{a_1,\ldots,a_t\}$ 10

Its name refers to a half-space exclusion rule, not to the graph-theoretic half graph $A=\{a_1,\ldots,a_t\}$ 11 (Talamantes et al., 2021).

Accordingly, the phrase half graph is context-sensitive. In graph theory proper, without further qualification, it denotes the ordered bipartite ladder $A=\{a_1,\ldots,a_t\}$ 12. In adjacent literatures it may refer instead to balanced Eulerian subgraphs, half-squares of bipartite graphs, one-sided regular factorizations, or constructions whose “half” comes from half-lines or half-spaces. For technical work, disambiguation by definition is therefore essential.