Pith. sign in

REVIEW

Multipath matroids, digraph colourings, and the Tutte polynomial

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.14528 v1 pith:IISTE4HJ submitted 2024-09-22 math.CO math.AT

Multipath matroids, digraph colourings, and the Tutte polynomial

classification math.CO math.AT
keywords multipathpolynomialtuttecolouringsdigraphmatroidprovecalled
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We characterise the digraphs for which the multipaths, that is disjoint unions of directed paths, yield a matroid. For such graphs, called MP-digraphs, we prove that the Tutte polynomial of the multipath matroid is related to counting certain digraph colourings. Finally, we prove that, for MP-forests, the decategorification of the multipath cohomology yields a specialisation of the Tutte polynomial.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.