Below-Guarantee Graph Coloring

• Below-guarantee graph coloring is a framework that sharpens standard coloring bounds (such as Δ+1 and Shannon’s theorem) by excluding minimal structural obstructions.
• Researchers employ techniques like recoloring, co-triangle packing, and algebraic modulators to reduce the number of colors needed in vertex, edge, and exact sampling contexts.
• These approaches yield improved fixed-parameter algorithms and approximation results while opening avenues for further exploration in hereditary graph classes and randomized methods.

Below-guarantee graph coloring denotes a family of research directions in which the objective is to improve on a baseline coloring guarantee. In vertex coloring, the baseline is typically a trivial or near-trivial upper bound such as $\Delta(G)+1$ or $\Delta(G)$, and the goal is to prove that $\chi(G)\le \Delta(G)-1$ unless a structural obstruction such as a large clique forces otherwise. In parameterized complexity, the question is whether a graph can be colored with $g-k$ colors when $g$ is an efficiently computable guarantee such as $n$ or $\omega+\overline{\mu}$. In multigraph edge-coloring, the goal is to maximize the size of a $\Delta$-edge-colorable subgraph beyond the fraction that follows from Shannon’s theorem. In exact sampling, the term is also used for algorithms that produce a perfect uniform sample of proper colorings while requiring fewer colors than earlier algorithmic guarantees. These usages are developed, respectively, in "Coloring some $(P_6,C_4)$-free graphs with $\Delta-1$ colors" (Chen et al., 2024), "Graph Coloring Below Guarantees via Co-Triangle Packing" (Akmal et al., 15 Sep 2025), "Beyond the Shannon's Bound" (Farnik et al., 2013), and "Fewer colors for perfect simulation of proper colorings" (Huber, 2020).

1. Canonical guarantees and the meaning of “below guarantee”

A recurring pattern in the literature is to begin with a universal guarantee and then ask whether one can save colors relative to that guarantee. For finite simple graphs, the basic parameters are the chromatic number $\Delta(G)$0, the maximum degree $\Delta(G)$1, and the clique number $\Delta(G)$2. The standard inequalities are $\Delta(G)$3 and $\Delta(G)$4 by greedy coloring. Brooks’ theorem sharpens the latter to

$\Delta(G)$5

The Borodin–Kostochka conjecture is the canonical below-guarantee statement in this setting:

$\Delta(G)$6

Equivalently, for $\Delta(G)$7, any graph with $\Delta(G)$8 must contain $\Delta(G)$9 (Chen et al., 2024).

In parameterized coloring, the same idea is recast as a decision problem. The graph is trivially colorable with $\chi(G)\le \Delta(G)-1$0 colors, and one asks whether it is colorable with $\chi(G)\le \Delta(G)-1$1 colors, where $\chi(G)\le \Delta(G)-1$2 measures how many colors are saved. Two guarantees are emphasized: $\chi(G)\le \Delta(G)-1$3, which yields $\chi(G)\le \Delta(G)-1$4-Coloring or Dual Coloring, and the stronger structural guarantee $\chi(G)\le \Delta(G)-1$5, where $\chi(G)\le \Delta(G)-1$6 is the maximum matching size in the complement graph. Every graph is colorable with at most $\chi(G)\le \Delta(G)-1$7 colors, and $\chi(G)\le \Delta(G)-1$8 (Akmal et al., 15 Sep 2025).

For multigraph edge-coloring, the relevant baseline is Shannon’s theorem:

$\chi(G)\le \Delta(G)-1$9

Below-guarantee edge-coloring asks how large a subgraph can be colored with only $g-k$0 colors even when the entire multigraph is not $g-k$1-edge-colorable. Writing $g-k$2 for the maximum fraction of edges in a $g-k$3-edge-colorable subgraph, Shannon’s theorem implies

$g-k$4

and the research objective is to beat this baseline whenever specific obstructions are absent (Farnik et al., 2013).

In exact sampling, the guarantee is algorithmic rather than existential. Earlier perfect-sampling methods required $g-k$5 colors to sample uniformly from the proper colorings of a graph. The below-guarantee objective is to lower that threshold while preserving exact uniformity and efficient expected runtime (Huber, 2020).

2. Below $g-k$6 in vertex coloring: the Borodin–Kostochka paradigm on hereditary classes

The paper "Coloring some $g-k$7-free graphs with $g-k$8 colors" proves the Borodin–Kostochka conjecture for two hereditary subclasses of $g-k$9-free graphs:

• $g$0-free graphs;
• $g$1-free graphs (Chen et al., 2024).

Here $g$2 denotes the induced path on $g$3 vertices and $g$4 the induced cycle on $g$5 vertices. The graph $g$6 is defined explicitly from an induced $g$7 by adding a triangle $g$8 and an edge $g$9 so that

$n$0

$n$1

with $n$2 and $n$3. The main theorems state that if $n$4 is $n$5-free with $n$6 and $n$7, then

$n$8

The $n$9 case follows from an external structural bound already known for $\omega+\overline{\mu}$0-free graphs:

$\omega+\overline{\mu}$1

If $\omega+\overline{\mu}$2 is additionally $\omega+\overline{\mu}$3-free, then $\omega+\overline{\mu}$4, hence $\omega+\overline{\mu}$5. This contradicts $\omega+\overline{\mu}$6 in a minimal counterexample, so the Borodin–Kostochka bound holds immediately in this subclass (Chen et al., 2024).

The $\omega+\overline{\mu}$7 case is substantially more intricate and exemplifies the minimal-counterexample and recoloring paradigm. For a hereditary class $\omega+\overline{\mu}$8, Catlin–Kostochka-type reductions show that it suffices to prove the conjecture for graphs in $\omega+\overline{\mu}$9 with $\Delta$0. A minimal counterexample with $\Delta$1 is called a relaxed graph; such a graph is $\Delta$2-vertex-critical, satisfies $\Delta$3, and has $\Delta$4 for every vertex. Fixing a $\Delta$5-degree vertex $\Delta$6 with

$\Delta$7

the proof considers a proper $\Delta$8-coloring $\Delta$9 of $(P_6,C_4)$0 such that $(P_6,C_4)$1 for $(P_6,C_4)$2 and $(P_6,C_4)$3. This is the canonical setup for recoloring arguments.

Several structural lemmas drive the contradiction. For each $(P_6,C_4)$4, the vertex $(P_6,C_4)$5 has no missing color among $(P_6,C_4)$6 in $(P_6,C_4)$7, so $(P_6,C_4)$8 has at most one repeat color in its neighborhood. If $(P_6,C_4)$9 and $\Delta-1$0 are nonadjacent, then there exists an induced $\Delta-1$1-alternating $\Delta-1$2–$\Delta-1$3 path, and internal vertices on such alternating paths have no missing colors. A global constraint shows that in a relaxed graph, at least one of the following must fail: each $\Delta-1$4 is nonadjacent to at most two of $\Delta-1$5, or $\Delta-1$6. A further structural lemma yields some $\Delta-1$7 with

$\Delta-1$8

This sparseness around one neighbor becomes the seed for the terminal case analysis.

The proof of the $\Delta-1$9-free theorem then constructs short alternating $\Delta(G)$00-paths between $\Delta(G)$01 and $\Delta(G)$02 for $\Delta(G)$03 and rules out the possible intersections of internal vertices. The exclusions rely on three ingredients: internal vertices on alternating paths have no missing colors; certain adjacencies force induced $\Delta(G)$04 or $\Delta(G)$05; and specific local patterns on vertices around $\Delta(G)$06, $\Delta(G)$07, $\Delta(G)$08, $\Delta(G)$09, $\Delta(G)$10, $\Delta(G)$11, and $\Delta(G)$12 inevitably induce a $\Delta(G)$13, contradicting the class assumption. The argument is existential and nonconstructive in the algorithmic sense, but it demonstrates a standard mechanism of below-guarantee vertex coloring: identify a local obstruction that sustains a hypothetical $\Delta(G)$14 configuration, then exclude it through alternating-path recoloring and forbidden-subgraph structure (Chen et al., 2024).

The same paper also records a corollary for further subclasses. Since the $\Delta(G)$15 construction contains several smaller forbidden subgraphs as induced subgraphs, the Borodin–Kostochka bound extends to $\Delta(G)$16-free graphs with

$\Delta(G)$17

It does not, however, settle the full $\Delta(G)$18-free case; the paper isolates the unresolved regime to $\Delta(G)$19.

3. Below-guarantee parameterizations and co-triangle packing

A distinct algorithmic interpretation appears in "Graph Coloring Below Guarantees via Co-Triangle Packing" (Akmal et al., 15 Sep 2025). The basic problem is $\Delta(G)$20-Coloring: given a graph $\Delta(G)$21, decide whether there exists a proper coloring with at most $\Delta(G)$22 colors. The below-guarantee form asks whether $\Delta(G)$23 is colorable with $\Delta(G)$24 colors, where $\Delta(G)$25 is a trivial or structural upper bound.

The paper develops a win–win framework around co-triangles, that is, independent sets of size $\Delta(G)$26 or induced $\Delta(G)$27 subgraphs. A co-triangle packing is a collection of vertex-disjoint co-triangles obtained greedily in polynomial time. For Dual Coloring, where $\Delta(G)$28, let $\Delta(G)$29 be a maximal packing and $\Delta(G)$30. If $\Delta(G)$31, then the graph is immediately a YES-instance for $\Delta(G)$32-Coloring because one color is assigned to each packed co-triangle and distinct colors to all remaining vertices, using

$\Delta(G)$33

colors. If instead $\Delta(G)$34, then the vertices in the packing form a co-triangle modulator $\Delta(G)$35 of size $\Delta(G)$36 such that $\Delta(G)$37 is co-triangle-free. This yields a randomized

$\Delta(G)$38

algorithm for $\Delta(G)$39-Coloring, improving the previous $\Delta(G)$40 bound.

The reason co-triangle-free structure is useful is that every color class in $\Delta(G)$41 has size at most $\Delta(G)$42; otherwise an independent triple would appear. This bounded color-class size enables an algebraic modulator algorithm. The principal extension theorem states that if $\Delta(G)$43 is a co-triangle-free modulator of size $\Delta(G)$44, then $\Delta(G)$45-Coloring can be solved in randomized

$\Delta(G)$46

time for arbitrary $\Delta(G)$47. The proof works in the complement graph, where $\Delta(G)$48-Coloring becomes $\Delta(G)$49-Clique Cover. Valid cover types $\Delta(G)$50 are enumerated, an auxiliary graph $\Delta(G)$51 is built so that perfect matchings encode how cliques intersect $\Delta(G)$52, and a skew-symmetric matrix is formed whose Pfaffian polynomial enumerates perfect matchings. Variables are then replaced by clique-polynomials over a squarefree ring $\Delta(G)$53, so that vertex-disjointness in $\Delta(G)$54 is enforced combinatorially. Randomized polynomial identity testing, a division-free Pfaffian circuit, and fast subset convolution produce the $\Delta(G)$55 bound.

The same packing principle also applies to the stronger guarantee $\Delta(G)$56, where $\Delta(G)$57. Every graph is colorable with at most $\Delta(G)$58 colors: if $\Delta(G)$59 is a maximal matching in $\Delta(G)$60 and $\Delta(G)$61 is the set of vertices not covered by $\Delta(G)$62, then $\Delta(G)$63 is independent in $\Delta(G)$64 and hence a clique in $\Delta(G)$65 of size at most $\Delta(G)$66; giving one color to each edge of $\Delta(G)$67 and one fresh color to each vertex of $\Delta(G)$68 yields a proper coloring with at most $\Delta(G)$69 colors. Since $\Delta(G)$70, the parameterization $\Delta(G)$71-Coloring is strictly harder than $\Delta(G)$72-Coloring. The paper nonetheless proves that it is solvable in randomized

$\Delta(G)$73

time.

The framework is complemented by negative results. There is no fixed-parameter tractable algorithm for $\Delta(G)$74-Coloring unless $\Delta(G)$75, and $\Delta(G)$76-Coloring is W[1]-hard. The paper therefore identifies a narrow tractability frontier: saving colors below $\Delta(G)$77 or below the combined guarantee $\Delta(G)$78 is fixed-parameter tractable via co-triangle packing, but parameterizing below $\Delta(G)$79 alone or below $\Delta(G)$80 alone is unlikely to be fixed-parameter tractable (Akmal et al., 15 Sep 2025).

4. Edge-coloring below Shannon’s bound

In multigraphs, below-guarantee coloring concerns the edge-chromatic index rather than the vertex chromatic number. "Beyond the Shannon's Bound" studies undirected multigraphs $\Delta(G)$81 of maximum degree $\Delta(G)$82 and asks how large a subgraph can be edge-colored with only $\Delta(G)$83 colors (Farnik et al., 2013).

Shannon’s theorem gives the worst-case upper bound

$\Delta(G)$84

Selecting the $\Delta(G)$85 largest color classes from a Shannon coloring yields the baseline ratio

$\Delta(G)$86

The paper improves this baseline by one unit in the denominator, proving that, except for explicit dense three-vertex obstructions, there exists a $\Delta(G)$87-edge-colorable subgraph with at least

$\Delta(G)$88

edges.

The exceptional configurations are completely characterized. For even $\Delta(G)$89, the obstruction is $\Delta(G)$90, the $\Delta(G)$91-vertex complete multigraph in which each pair has multiplicity $\Delta(G)$92. For odd $\Delta(G)$93, the obstruction is $\Delta(G)$94, a triangle where one edge has one additional parallel copy. These are exactly the dense triangle gadgets that force equality in Shannon-type behavior and prevent improvement beyond the baseline fraction. For $\Delta(G)$95, earlier work of Kamiński and Kowalik gives a $\Delta(G)$96-edge-colorable subgraph of size at least

$\Delta(G)$97

unless the graph has a component isomorphic to $\Delta(G)$98; the present paper extends the same below-guarantee phenomenon to all $\Delta(G)$99 (Farnik et al., 2013).

The proof is constructive and algorithmic. A partial $\chi(G)\le \Delta(G)-1$00-coloring $\chi(G)\le \Delta(G)-1$01 is evaluated by a potential function $\chi(G)\le \Delta(G)-1$02 that orders colorings lexicographically according to the number of colored edges and the distribution of free components. Local recolorings, called elementary moves, uncolor some edges in the closed neighborhood of a free component and color an equal number of edges inside it. A global charging method assigns one unit of charge from each colored edge to the nontrivial free components that control its endpoints. Lower bounds on the charge received by each free component imply a lower bound on the total number of colored edges. The argument is reinforced by collapsing $\chi(G)\le \Delta(G)-1$03-collapsible $\chi(G)\le \Delta(G)-1$04-vertex subgraphs, which reduces local density while preserving the relevant three-vertex thresholds. The resulting algorithm runs in polynomial time; for fixed $\chi(G)\le \Delta(G)-1$05, the paper gives the bound

$\chi(G)\le \Delta(G)-1$06

where $\chi(G)\le \Delta(G)-1$07 and $\chi(G)\le \Delta(G)-1$08.

These structural results feed directly into approximation algorithms for Maximum $\chi(G)\le \Delta(G)-1$09-Edge-Colorable Subgraph. The paper derives a

$\chi(G)\le \Delta(G)-1$10

approximation for every even $\chi(G)\le \Delta(G)-1$11 and a

$\chi(G)\le \Delta(G)-1$12

approximation for every odd $\chi(G)\le \Delta(G)-1$13 (Farnik et al., 2013). In this multigraph setting, below-guarantee coloring is thus both a structural theorem and an approximation framework: the task is not to color the whole graph with fewer than the universal guarantee, but to recover a provably large colorable subgraph beyond what the universal guarantee alone would imply.

5. Fewer colors for exact uniform sampling

A further usage of the same theme appears in exact sampling. "Fewer colors for perfect simulation of proper colorings" studies the problem of sampling exactly uniformly from the set $\chi(G)\le \Delta(G)-1$14 of proper $\chi(G)\le \Delta(G)-1$15-colorings of a graph $\chi(G)\le \Delta(G)-1$16 with maximum degree $\chi(G)\le \Delta(G)-1$17 (Huber, 2020). In this context, “below guarantee” refers to reducing the number of colors required by general-purpose perfect-sampling algorithms.

The paper gives a randomized perfect simulator based on the randomness recycler protocol. For every graph with $\chi(G)\le \Delta(G)-1$18, if

$\chi(G)\le \Delta(G)-1$19

then the algorithm outputs an exact uniform sample from $\chi(G)\le \Delta(G)-1$20 in

$\chi(G)\le \Delta(G)-1$21

expected steps, where $\chi(G)\le \Delta(G)-1$22. This improves the earlier perfect-sampling guarantee of Bhandari and Chakraborty, which required $\chi(G)\le \Delta(G)-1$23.

The protocol maintains a set $\chi(G)\le \Delta(G)-1$24 of currently colored vertices and a proper partial coloring $\chi(G)\le \Delta(G)-1$25, initially with $\chi(G)\le \Delta(G)-1$26. Its invariant is that $\chi(G)\le \Delta(G)-1$27 is uniformly distributed over the proper colorings of the induced subgraph $\chi(G)\le \Delta(G)-1$28. At each step, an uncolored vertex $\chi(G)\le \Delta(G)-1$29 is chosen and a proposal color $\chi(G)\le \Delta(G)-1$30 is sampled uniformly. If no colored neighbor of $\chi(G)\le \Delta(G)-1$31 has color $\chi(G)\le \Delta(G)-1$32, the proposal is accepted. If conflicts occur, the algorithm defines the conflict set

$\chi(G)\le \Delta(G)-1$33

and performs a local recycle surgery: $\chi(G)\le \Delta(G)-1$34 is colored with $\chi(G)\le \Delta(G)-1$35, the vertices in $\chi(G)\le \Delta(G)-1$36 are uncolored, and the consumed random bits are kept live rather than discarded. The central claim is that this update is measure-preserving, so the uniformity invariant survives every step.

The analysis is drift-based. Let $\chi(G)\le \Delta(G)-1$37 be the number of colored vertices. The raw change after one step is $\chi(G)\le \Delta(G)-1$38, so the goal is to bound the expected size of the conflict set. A representative sufficient inequality is

$\chi(G)\le \Delta(G)-1$39

and the recycler-specific analysis strengthens this with localized dependency bounds to obtain the linear threshold $\chi(G)\le \Delta(G)-1$40. A multiplicative-drift argument then yields the $\chi(G)\le \Delta(G)-1$41 expected runtime.

This exact-sampling interpretation differs from existential vertex-coloring and fixed-parameter coloring, but the common principle remains the same: a previously accepted color threshold serves as the guarantee, and the contribution lies in proving that fewer colors suffice while preserving a stringent notion of correctness. Here the correctness requirement is exact uniformity rather than merely the existence of a proper coloring (Huber, 2020).

6. Structural themes, limitations, and open directions

Across these formulations, below-guarantee graph coloring is driven by the interaction between baseline bounds and explicit obstructions. In the Borodin–Kostochka setting, the obstruction is a large clique or, in restricted hereditary classes, a specific induced configuration such as $\chi(G)\le \Delta(G)-1$42. In co-triangle-packing algorithms, the obstruction is the failure to find enough disjoint co-triangles, which is then converted into a small modulator. In Shannon-type edge-coloring, the obstruction is a dense $\chi(G)\le \Delta(G)-1$43-vertex multigraph. In perfect sampling, the obstruction is not combinatorial in the same sense; it is the point at which recycling no longer guarantees positive drift under a given palette size. This suggests a broad unifying viewpoint: below-guarantee results typically succeed by isolating a minimal local structure that saturates the baseline guarantee, then proving that all other instances admit either recoloring, packing, or algebraic compression.

The limitations are equally structural. The $\chi(G)\le \Delta(G)-1$44-free Borodin–Kostochka problem remains open in general; the available reduction shows that it would suffice to settle the cases $\chi(G)\le \Delta(G)-1$45 and $\chi(G)\le \Delta(G)-1$46 (Chen et al., 2024). The co-triangle framework yields randomized algorithms, but removing randomization and obtaining deterministic fixed-parameter algorithms of comparable runtime is open; so is improving the exponents, in particular reaching $\chi(G)\le \Delta(G)-1$47 for Dual Coloring and improving the $\chi(G)\le \Delta(G)-1$48 bound for $\chi(G)\le \Delta(G)-1$49-Coloring (Akmal et al., 15 Sep 2025). In edge-coloring, the paper identifies the exact dense triangle obstructions but also asks what the next bottleneck beyond these obstructions should be, and to what extent stronger local sparsity assumptions on three vertices yield better fractions (Farnik et al., 2013). In perfect simulation, pushing the threshold from $\chi(G)\le \Delta(G)-1$50 toward $\chi(G)\le \Delta(G)-1$51 or even toward $\chi(G)\le \Delta(G)-1$52 is explicitly left open (Huber, 2020).

Taken together, these works show that below-guarantee graph coloring is not a single theorem but a research program spanning structural graph theory, fixed-parameter algorithms, multigraph edge-coloring, approximation, and exact randomized algorithms. Its common methodology is to sharpen a universal bound by one of three means: excluding a forbidden local configuration, exploiting a packing-or-modulator dichotomy, or maintaining a measure-preserving process whose drift becomes positive below the previous threshold.