A mathematical preprint has established that a signed version of a graph-colouring bound holds for every finite simple signed graph of treewidth 3, and also for graphs of treewidth 4 when their maximum degree is at least 10. In both cases, the signed list edge chromatic number is no more than Δ + 1, where Δ denotes the graph’s maximum degree.
In plain language, the result limits how large the assigned colour lists need to be in these graph classes. The maximum degree is the largest number of edges meeting at any one vertex, while treewidth describes a restricted, tree-like form of graph structure.
The conclusion is exact but deliberately narrow: treewidth 3 is covered without an additional degree condition, while the treewidth-4 case begins only at maximum degree 10.
One framework for lists and signed edges
The paper introduces signed list edge colouring as a framework that generalizes classical list edge colouring and Behr’s signed edge colouring. It combines the question of choosing colours from assigned lists with the additional structure carried by a signed graph.
That formulation gives the authors one language for studying both the list-colouring problem and its signed counterpart. The central quantity is the signed list edge chromatic number, the number constrained by the new upper bound.
The preprint describes its main result as verification of the signed version of Conjecture 1.1 in the two stated settings, and as an improvement of a result of Lang.
A proof built around a possible counterexample
The result comes from a deductive proof rather than from measurements or a sampled data set. Its main ingredients are a polynomial condition, switching invariance, a structural argument for bounded-treewidth graphs and a minimum-counterexample contradiction.
The algebraic part uses Alon’s Combinatorial Nullstellensatz, a tool from algebraic combinatorics. Applied to a polynomial associated with a signed graph, it supplies a sufficient condition for an L-edge-colouring compatible with the assigned lists.
The proof also shows that the list edge chromatic number is invariant under switching equivalence. This means signatures related by switching can be handled without changing the colouring number the argument is trying to bound.
The contradiction begins by assuming a counterexample exists and choosing one with the fewest edges. In this setup, the maximum degree is at least 3 and every half-edge receives a list of size Δ + 1.
The structural part then shows that the relevant bipartite graph contains a K3,3 subgraph. This identifies a specific configuration that the proof can isolate and treat with a separate colouring result.
The small configuration that closes the argument
The separate result says that every signed copy of K3,3 is 3-list-edge-colourable, whatever its signature. That lemma supplies the key local colouring step in the final reduction.
At the end of the proof, the reduced object, called Q, has remaining half-edge lists of size at least 3. The signed K3,3 lemma makes Q fQ-list-edge-colourable, producing the contradiction required to rule out the supposed minimum-edge counterexample.
The argument therefore moves from a global colouring question to an algebraic condition and then to a bounded-treewidth structural reduction. The final K3,3 step brings those pieces together and completes the proof of the upper bound.
The unanswered cases remain outside the theorem
The result establishes an upper bound, not the claim that Δ + 1 colours are always necessary. It does not show that the bound is tight or that equality must occur.
The treewidth-4 result does not cover graphs whose maximum degree is below 10, and the theorem does not address higher treewidth. Whether the same bound holds in those settings is not resolved by the supplied result.
Nor does the theorem cover all finite simple signed graphs. Its conclusion applies only to the two graph classes specified in the statement, so extending it would require separate arguments for the remaining cases.
Because this is a proof study, the evidence is a chain of definitions, polynomial coefficient arguments, switching properties and structural deductions. It reports no empirical performance measure or statistical estimate.
A preprint result
The work is identified as arXiv:2608.19852v1 and dated 20 August 2026. The publication record lists it as a preprint.
The text reports partial support from the National Natural Science Foundation of China under grant numbers 12271438, 12431013 and U2141238.
Paper data and sources
Original title: Signed list edge coloring in graphs of bounded treewidth
Authors: Li Zhang, You Lu, Zhengke Miao, Yintao Wang
Journal/Repository: arXiv
Status: Preprint, not yet peer-reviewed
First online: 2026-08-20
DOI: Not available
Original paper · Full text