Counting degree-constrained orientations

DOI10.1016/J.DISC.2026.115024MaRDI QIDQ6846047zbMATH OpenFDO

Authors Jing Yu, Jie-Xiang Zhu

Publication date 12 March 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115024

zbMATH Keywords

gauge transformationorientationrandom polynomial

Mathematics Subject Classification ID

Graph theory (05Cxx) Theory of computing (68Qxx) Algorithms in computer science (68Wxx)

Cites work

• A short survey on stable polynomials, orientations and matchings
• Basis collapse in holographic algorithms
• Complexity Dichotomies for Counting Problems
• Counting degree-constrained subgraphs and orientations
• Expressiveness of matchgates.
• Holographic Algorithms
• Holographic algorithms: from art to science
• Holographic algorithms: the power of dimensionality resolved
• scientific article; zbMATH DE number 5174567 (Why is no real title available?)
• Loop calculus in statistical physics and information science
• Loop series for discrete statistical models on graphs
• On symmetric signatures in holographic algorithms
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time

This page was built for publication: Counting degree-constrained orientations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846047)