A Trivariate Dichromate Polynomial for Digraphs
Winfried Hochst\"attler, Johanna Wiehe
TL;DR
This paper introduces a new trivariate polynomial that unifies two existing polynomials to count acyclic colorings in directed graphs and extends this concept to regular oriented matroids.
Contribution
It defines a novel polynomial combining NL-coflow and NL-flow polynomials, broadening their application to regular oriented matroids.
Findings
Unified polynomial for acyclic colorings in digraphs
Extension of polynomials to regular oriented matroids
Potential applications in graph coloring and matroid theory
Abstract
We define a trivariate polynomial combining the NL-coflow and the NL-flow polynomial, which build a dual pair counting acyclic colorings of directed graphs, in the more general setting of regular oriented matroids.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Graph Theory Research · graph theory and CDMA systems