Cochromatic Bases in Graph Colouring & Combinatorics

• Cochromatic bases are families of constructions in graph theory and combinatorics that partition graphs into cliques and independent sets, offering a unified framework.
• They extend traditional proper colouring by allowing mixed homogeneous classes, as seen when complete graphs have ζ(Kₙ)=1 versus χ(Kₙ)=n.
• In algebraic combinatorics, cochromatic methods underpin generalized chromatic functions that recover classical symmetric and quasisymmetric function bases.

Searching arXiv for papers related to “cochromatic bases”, generalized chromatic functions, complete multipartite bases, and cochromatic number. “Cochromatic bases” is not introduced as a single formal term across the cited literature, but the phrase usefully names a family of closely related constructions at the interface of graph colouring, cochromatic structure, and symmetric or quasisymmetric function theory. In graph theory, the relevant primitive is the cochromatic number $\zeta(G)$, defined as the minimum number of colours in a vertex colouring whose colour classes are each either independent sets or cliques (Steiner, 2024, Heckel, 2024). In algebraic combinatorics, the analogous perspective appears when classical bases of $\mathrm{Sym}(x)$, $\mathrm{QSym}(x)$, and their noncommutative variants are realized as generalized chromatic functions of specially designed edge-coloured digraphs, or when bases are built from graphs complementary to disjoint unions of cliques, such as the complete multipartite basis $\{r_\lambda\}$ (Aliniaeifard et al., 2022, Crew et al., 2020). Taken together, these developments present a “cochromatic” viewpoint in which partitions into independent sets and cliques, complement symmetry, and graph-based generating functions provide a common language for both extremal graph colouring problems and basis constructions in combinatorial Hopf algebras.

1. Graph-theoretic origin: cochromatic colourings and $\zeta(G)$

The cochromatic number of a graph $G$, denoted $\zeta(G)$, is the minimum number of colours needed for a vertex colouring in which every colour class is either an independent set or a clique (Steiner, 2024, Heckel, 2024, Heckel, 2024). Equivalently, $\zeta(G)$ is the minimum number of parts in a partition of $V(G)$ into homogeneous sets, where a homogeneous set is either an independent set or a clique (Steiner, 2024). This extends ordinary proper colouring, since the chromatic number $\chi(G)$ permits only independent sets as colour classes; consequently,

$\mathrm{Sym}(x)$0

This inequality is explicit in the graph-theoretic papers and is the basic reason cochromatic partitions are more flexible than proper colourings (Steiner, 2024, Heckel, 2024, Heckel, 2024).

A central structural feature is complement symmetry. The cochromatic number is invariant under complements,

$\mathrm{Sym}(x)$1

and one also has

$\mathrm{Sym}(x)$2

because a proper colouring of $\mathrm{Sym}(x)$3 gives a partition of $\mathrm{Sym}(x)$4 into cliques (Heckel, 2024, Steiner, 2024). This complement behaviour is one of the main reasons the adjective “cochromatic” acquires a basis-like meaning in later algebraic settings: it emphasizes decomposition into clique-type and stable-set-type pieces, rather than only stable sets.

The distinction from ordinary chromatic structure can be extreme. Complete graphs satisfy $\mathrm{Sym}(x)$5 but $\mathrm{Sym}(x)$6 (Steiner, 2024). A plausible implication is that cochromatic invariants are best viewed not as minor perturbations of chromatic invariants, but as hybrid objects interpolating between chromatic number and clique cover phenomena. This hybrid character is explicit in the random-graph and bounded-clique-number results discussed below.

2. Extremal separation between chromatic and cochromatic structure

The graph-theoretic literature around Erdős and Gimbel studies how large the difference $\mathrm{Sym}(x)$7 can be, especially under bounded clique number. For each integer $\mathrm{Sym}(x)$8, Erdős, Gimbel, and Straight defined $\mathrm{Sym}(x)$9 as the smallest integer such that every graph $\mathrm{QSym}(x)$0 with $\mathrm{QSym}(x)$1, except for $\mathrm{QSym}(x)$2, satisfies

$\mathrm{QSym}(x)$3

They proved that $\mathrm{QSym}(x)$4 is well-defined, that $\mathrm{QSym}(x)$5 grows exponentially with $\mathrm{QSym}(x)$6, and that $\mathrm{QSym}(x)$7 and $\mathrm{QSym}(x)$8 (Steiner, 2024). The 2024 note shows that for fixed $\mathrm{QSym}(x)$9, determining the exact value of $\{r_\lambda\}$0 reduces to a finite computation: for $\{r_\lambda\}$1 and $\{r_\lambda\}$2, there is an explicit constant $\{r_\lambda\}$3 such that

$\{r_\lambda\}$4

for all graphs $\{r_\lambda\}$5 with $\{r_\lambda\}$6 and $\{r_\lambda\}$7 (Steiner, 2024). The reduction uses Ramsey theory, together with an observation bounding $\{r_\lambda\}$8 by repeatedly removing independent sets of size $\{r_\lambda\}$9.

A more decisive result concerns the conjecture that every graph $\zeta(G)$0 with $\zeta(G)$1 and $\zeta(G)$2 satisfies

$\zeta(G)$3

This conjecture is disproved by infinitely many explicit counterexamples (Steiner, 2024). The paper proves that there are infinitely many graphs $\zeta(G)$4 such that

$\zeta(G)$5

so in particular

$\zeta(G)$6

for infinitely many $\zeta(G)$7-free graphs (Steiner, 2024). The construction is organized around an 11-vertex auxiliary graph $\zeta(G)$8 with $\zeta(G)$9, whose vertex set can be partitioned into 3 cliques, and such that every proper 6-colouring of $G$0 exposes a subset $G$1 with $G$2 on which all six colours appear (Steiner, 2024). Enlarging $G$3 by adding independent sets $G$4 adjacent exactly to such subsets forces $G$5, while a cochromatic partition of $G$6 into 3 cliques together with the new vertices as an independent set yields $G$7; the paper then shows $G$8, hence $G$9 (Steiner, 2024).

This use of a small “trigger” gadget gives a concrete model of cochromatic structure. The cited summary states that the paper “does not use the phrase ‘cochromatic bases’ as a formal term,” but that the gadget $\zeta(G)$0 forces any proper colouring to expose a “basis-like” subset $\zeta(G)$1 on which all colours appear while clique number remains small (Steiner, 2024). This suggests an interpretation of cochromatic bases, in the graph-theoretic sense, as structured families of homogeneous pieces or witness subsets through which low cochromatic number fails to control full chromatic complexity.

3. Random graphs and the asymptotic gap $\zeta(G)$2

For $\zeta(G)$3, Erdős and Gimbel asked whether

$\zeta(G)$4

This question appears in multiple 2024 papers and is treated through progressively stronger results (Steiner, 2024, Heckel, 2024, Heckel, 2024).

One note gives positive evidence by proving that for every $\zeta(G)$5, there exists an absolute constant $\zeta(G)$6 such that for infinitely many $\zeta(G)$7,

$\zeta(G)$8

and therefore

$\zeta(G)$9

(Steiner, 2024). The argument combines anti-concentration for $\zeta(G)$0 with the Harris–FKG inequality and the bound $\zeta(G)$1 (Steiner, 2024).

A companion note establishes a non-concentration obstruction. Its main theorem states that if $\zeta(G)$2 and $\zeta(G)$3 satisfies

$\zeta(G)$4

then there is a sequence of integers $\zeta(G)$5 such that

$\zeta(G)$6

for some constant $\zeta(G)$7 (Heckel, 2024). The mechanism is to show that a high-probability bound on $\zeta(G)$8 would force concentration of $\zeta(G)$9 into intervals of length $V(G)$0, contradicting a prior lower bound on the concentration width of the chromatic number (Heckel, 2024). The proof relies on complement invariance of $V(G)$1, the fact that $V(G)$2 is decreasing in the edge set, the fact that $V(G)$3 is increasing in the edge set of $V(G)$4, and Harris’s Lemma (Heckel, 2024).

A later paper proves a much stronger statement for most $V(G)$5. With

$V(G)$6

and

$V(G)$7

the theorem states: if $V(G)$8 is fixed and

$V(G)$9

then for $\chi(G)$0,

$\chi(G)$1

(Heckel, 2024). The paper summarizes this as a positive answer for roughly $\chi(G)$2 of all values $\chi(G)$3 (Heckel, 2024). The proof combines a lower bound on $\chi(G)$4 derived from a result of Heckel–Panagiotou with an upper bound on $\chi(G)$5 obtained by a second moment argument for cochromatic colourings, followed by Azuma–Hoeffding concentration and a “shift by a little” trick from Frieze (Heckel, 2024).

The structural message of these random-graph results is that cochromatic flexibility is asymptotically significant even when $\chi(G)$6 and $\chi(G)$7 have the same first-order scale. Indeed, the same paper records the heuristic that cochromatic colourings at a given profile are more numerous than ordinary colourings by a factor of $\chi(G)$8, because each colour class may be either a clique or an independent set (Heckel, 2024). This is formalized in the identity

$\chi(G)$9

for appropriate profiles with $\mathrm{Sym}(x)$00 (Heckel, 2024). A plausible implication is that “cochromatic basis” phenomena in random graphs are driven by the multiplicative choice of clique-type versus stable-set-type classes.

4. Generalized chromatic functions as a unifying algebraic framework

The most explicit basis-theoretic realization of a cochromatic viewpoint appears in the theory of generalized chromatic functions for edge-partitioned digraphs (Aliniaeifard et al., 2022). Here edges come in three types:

• dashed: $\mathrm{Sym}(x)$01,
• solid: $\mathrm{Sym}(x)$02,
• double: $\mathrm{Sym}(x)$03.

A proper vertex-colouring of such a digraph $\mathrm{Sym}(x)$04 is a map $\mathrm{Sym}(x)$05 satisfying

$\mathrm{Sym}(x)$06

$\mathrm{Sym}(x)$07

$\mathrm{Sym}(x)$08

With

$\mathrm{Sym}(x)$09

the generalized chromatic function is

$\mathrm{Sym}(x)$10

This single definition simultaneously recovers proper graph colourings, $\mathrm{Sym}(x)$11-partitions, chromatic symmetric functions, chromatic quasisymmetric functions, and related objects (Aliniaeifard et al., 2022).

The graph-colouring case arises when all edges are dashed, so $\mathrm{Sym}(x)$12 becomes Stanley’s chromatic symmetric function (Aliniaeifard et al., 2022). The $\mathrm{Sym}(x)$13-partition case arises from the Hasse diagram of a poset with edge types determined by the poset-labeling; Proposition 3.3 gives a bijection between $\mathrm{Sym}(x)$14-partitions and proper colourings of the corresponding edge-coloured digraph (Aliniaeifard et al., 2022). The framework also recovers the Shareshian–Wachs chromatic quasisymmetric function and Ellzey’s chromatic quasisymmetric function by using only dashed edges with suitable orientations (Aliniaeifard et al., 2022).

Within this formalism, many classical bases of $\mathrm{Sym}(x)$15 and $\mathrm{Sym}(x)$16 are realized as generalized chromatic functions of specially chosen digraphs (Aliniaeifard et al., 2022). The cited summary explicitly lists the monomial symmetric basis $\mathrm{Sym}(x)$17, augmented monomial basis, elementary basis $\mathrm{Sym}(x)$18, complete homogeneous basis $\mathrm{Sym}(x)$19, power sum basis $\mathrm{Sym}(x)$20, and Schur basis $\mathrm{Sym}(x)$21 as realizable special cases, together with the monomial quasisymmetric basis $\mathrm{Sym}(x)$22, the fundamental basis $\mathrm{Sym}(x)$23, and the upper-fundamental basis (Aliniaeifard et al., 2022). It also states that if one generalizes the graph for a partition $\mathrm{Sym}(x)$24 to a composition $\mathrm{Sym}(x)$25, one recovers the dual immaculate and row-strict dual immaculate functions as well (Aliniaeifard et al., 2022).

The basis-theoretic significance is not merely representational. The functions satisfy a product formula

$\mathrm{Sym}(x)$26

and a coproduct formula

$\mathrm{Sym}(x)$27

where $\mathrm{Sym}(x)$28 ranges over the $\mathrm{Sym}(x)$29-induced subdigraphs of $\mathrm{Sym}(x)$30 (Aliniaeifard et al., 2022). This is the algebraic mechanism through which the graph-theoretic data of edge-coloured digraphs becomes a source of bases and Hopf structures. The summary explicitly describes this as a conceptual contribution: a single chromatic-generating-function formalism encodes graph colourings, poset $\mathrm{Sym}(x)$31-partitions, symmetric functions, quasisymmetric functions, and their noncommutative analogues (Aliniaeifard et al., 2022).

In this sense, “cochromatic bases” can be understood as basis families whose defining data consist of graph- or digraph-based colouring rules broad enough to interpolate between independent-set and clique-type behaviour. This interpretation is consistent with the summary’s statement that generalized chromatic functions provide a unifying “cochromatic” language in which many classical bases are “literally the same objects arising from different edge-coloured digraphs” (Aliniaeifard et al., 2022).

5. Complete multipartite bases and the complement-of-cliques viewpoint

A more specific basis construction is the complete multipartite basis $\mathrm{Sym}(x)$32 of symmetric functions (Crew et al., 2020). For an integer partition $\mathrm{Sym}(x)$33 of $\mathrm{Sym}(x)$34, define the complete multipartite graph $\mathrm{Sym}(x)$35 with vertex set

$\mathrm{Sym}(x)$36

and edge set

$\mathrm{Sym}(x)$37

Then

$\mathrm{Sym}(x)$38

(Crew et al., 2020). Since $\mathrm{Sym}(x)$39 consists of disjoint stable sets of sizes $\mathrm{Sym}(x)$40 with all possible edges between distinct parts, it is the complement of a disjoint union of cliques. The paper notes that

$\mathrm{Sym}(x)$41

so the $\mathrm{Sym}(x)$42-basis is the graph-complement analogue of the elementary basis (Crew et al., 2020).

This complement relation is why the basis can naturally be described as “complete multipartite” and, in the paper’s own summarized wording, “cochromatic” (Crew et al., 2020). The terminology reflects two facts: each $\mathrm{Sym}(x)$43 is the chromatic symmetric function of a complete multipartite graph, and the complement of that graph is a disjoint union of cliques, the structure governing the elementary basis (Crew et al., 2020). The paper also states that Penaguiao had already shown that $\mathrm{Sym}(x)$44 is a basis for $\mathrm{Sym}(x)$45 (Crew et al., 2020).

The basis admits explicit change-of-basis formulas with the monomial basis. For partitions $\mathrm{Sym}(x)$46 and $\mathrm{Sym}(x)$47, the coefficient $\mathrm{Sym}(x)$48 is interpreted by “puzzles of $\mathrm{Sym}(x)$49 into $\mathrm{Sym}(x)$50,” and the transition matrix from $\mathrm{Sym}(x)$51 to $\mathrm{Sym}(x)$52 is upper triangular with $\mathrm{Sym}(x)$53’s on the diagonal (Crew et al., 2020). The inverse coefficients $\mathrm{Sym}(x)$54 admit a necklace interpretation; in particular,

$\mathrm{Sym}(x)$55

where $\mathrm{Sym}(x)$56 counts cyclically ordered set partitions of $\mathrm{Sym}(x)$57 of type $\mathrm{Sym}(x)$58 (Crew et al., 2020).

The central combinatorial application is the $\mathrm{Sym}(x)$59-basis expansion of chromatic and Tutte symmetric functions. If $\mathrm{Sym}(x)$60 are the maximal stable partitions of a graph $\mathrm{Sym}(x)$61, then

$\mathrm{Sym}(x)$62

where $\mathrm{Sym}(x)$63 is the meet of partitions (Crew et al., 2020). Thus the coefficient of $\mathrm{Sym}(x)$64 is controlled by inclusion–exclusion over intersections of maximal stable partitions (Crew et al., 2020). This is precisely a basis description in terms of overlap patterns of stable-set decompositions, which is why the $\mathrm{Sym}(x)$65-basis is especially apt for a cochromatic interpretation.

6. Noncommutative and $\mathrm{Sym}(x)$66-analogues of chromatic-basis constructions

The generalized chromatic framework extends to noncommuting variables. For a labelled edge-coloured digraph $\mathrm{Sym}(x)$67 with vertex set $\mathrm{Sym}(x)$68, and a colouring $\mathrm{Sym}(x)$69, define

$\mathrm{Sym}(x)$70

Then

$\mathrm{Sym}(x)$71

and there is a commutation map

$\mathrm{Sym}(x)$72

such that

$\mathrm{Sym}(x)$73

(Aliniaeifard et al., 2022). The same paper introduces the Hopf algebra

$\mathrm{Sym}(x)$74

and proves in Theorem 13.1 that $\mathrm{Sym}(x)$75 is a Hopf algebra (Aliniaeifard et al., 2022). The natural bases include the $\mathrm{Sym}(x)$76-dominant monomial basis $\mathrm{Sym}(x)$77 and the $\mathrm{Sym}(x)$78-fundamental basis $\mathrm{Sym}(x)$79 (Aliniaeifard et al., 2022). These are again obtained directly from generalized chromatic functions of labelled edge-coloured digraphs.

A different analogue arises in the algebra

$\mathrm{Sym}(x)$80

of symmetric functions generated by the odd power sums (Cho et al., 2019). The obstacle is explicit: ordinary chromatic symmetric functions almost never lie in $\mathrm{Sym}(x)$81. In fact, the paper proves that a finite simple graph $\mathrm{Sym}(x)$82 has no edges if and only if

$\mathrm{Sym}(x)$83

(Cho et al., 2019). To obtain an analogue of chromatic bases inside $\mathrm{Sym}(x)$84, the authors define the near chromatic symmetric function

$\mathrm{Sym}(x)$85

where $\mathrm{Sym}(x)$86 is the involution on $\mathrm{Sym}(x)$87 (Cho et al., 2019).

The classification is quite restrictive. If $\mathrm{Sym}(x)$88, then $\mathrm{Sym}(x)$89 has no pair of disjoint edges; if $\mathrm{Sym}(x)$90 is connected, then $\mathrm{Sym}(x)$91 is either $\mathrm{Sym}(x)$92 or a star $\mathrm{Sym}(x)$93 (Cho et al., 2019). More precisely,

$\mathrm{Sym}(x)$94

where $\mathrm{Sym}(x)$95 is either $\mathrm{Sym}(x)$96 or $\mathrm{Sym}(x)$97 for some $\mathrm{Sym}(x)$98 (Cho et al., 2019). The paper then identifies two algebraically independent generating sets of near chromatic symmetric functions,

$\mathrm{Sym}(x)$99

and states that these are the only algebraically independent generator sets of $\mathrm{QSym}(x)$00 consisting of near chromatic symmetric functions (Cho et al., 2019). For the corresponding graph sets $\mathrm{QSym}(x)$01 and $\mathrm{QSym}(x)$02, the families $\mathrm{QSym}(x)$03 and $\mathrm{QSym}(x)$04 form bases of $\mathrm{QSym}(x)$05 (Cho et al., 2019).

These constructions are not phrased as cochromatic bases in the graph-theoretic sense, but they belong to the same chromatic-basis lineage. A plausible implication is that the “cochromatic” theme survives beyond ordinary chromatic symmetric functions only after suitable symmetrization or graph-class restriction.

7. Terminological scope, unifying themes, and open directions

Across the cited papers, “cochromatic” has two distinct but connected meanings. In graph theory, it refers directly to partitions into independent sets and cliques and to the invariant $\mathrm{QSym}(x)$06 (Steiner, 2024, Heckel, 2024, Heckel, 2024). In algebraic combinatorics, it refers more broadly to basis constructions and generating functions built from graph-complement structure, multipartite graphs, or generalized colouring rules that unify clique-like and stable-set-like data (Aliniaeifard et al., 2022, Crew et al., 2020). The literature does not standardize “cochromatic bases” as a formal umbrella term, but the summaries explicitly describe the generalized chromatic-function viewpoint as a unifying “cochromatic” language and the complete multipartite basis as both “complete multipartite” and “cochromatic” (Aliniaeifard et al., 2022, Crew et al., 2020).

Several recurrent themes organize the subject.

Theme	Graph-theoretic manifestation	Algebraic manifestation
Complement symmetry	$\mathrm{QSym}(x)$07 and $\mathrm{QSym}(x)$08	$\mathrm{QSym}(x)$09 is complementary to $\mathrm{QSym}(x)$10 via $\mathrm{QSym}(x)$11 and $\mathrm{QSym}(x)$12
Mixed homogeneous classes	Colour classes may be independent sets or cliques	Edge-coloured digraph rules interpolate between graph colourings and $\mathrm{QSym}(x)$13-partitions
Partition structure	Cochromatic partitions and witness subsets $\mathrm{QSym}(x)$14 control $\mathrm{QSym}(x)$15 gaps	Basis coefficients encode stable partitions and their intersections

One open direction is explicit in the random-graph literature. The question whether

$\mathrm{QSym}(x)$16

for $\mathrm{QSym}(x)$17 is now answered positively for roughly $\mathrm{QSym}(x)$18 of all $\mathrm{QSym}(x)$19 (Heckel, 2024), but not yet for all $\mathrm{QSym}(x)$20. The same paper conjectures that whp

$\mathrm{QSym}(x)$21

(Heckel, 2024), while the earlier note gives the heuristic that the first-moment threshold for cochromatic number should be smaller than that for chromatic number by about

$\mathrm{QSym}(x)$22

(Heckel, 2024). This places the proven lower bounds and conjectured upper bounds on widely separated scales.

Another open direction concerns the algebraic side. The generalized chromatic-function formalism already realizes many classical bases of $\mathrm{QSym}(x)$23, $\mathrm{QSym}(x)$24, and their noncommutative analogues as graph-based objects (Aliniaeifard et al., 2022). This suggests that further “cochromatic basis” phenomena may emerge whenever one can encode basis-defining inequalities or incompatibilities through edge-coloured digraphs. That implication is interpretive rather than explicit, but it is closely aligned with the cited paper’s claim that many classical bases are realized as specialized generalized chromatic functions (Aliniaeifard et al., 2022).

In summary, cochromatic bases are best understood as basis constructions and structural decompositions organized by the same principle that defines cochromatic number: graph partitions are allowed to mix stable-set and clique behaviour. In graph theory this principle governs the invariant $\mathrm{QSym}(x)$25 and its separation from $\mathrm{QSym}(x)$26; in algebraic combinatorics it governs graph-complement bases such as $\mathrm{QSym}(x)$27 and unifying chromatic formalisms in which numerous classical bases appear as special cases (Steiner, 2024, Crew et al., 2020, Aliniaeifard et al., 2022).