Counting degree-constrained subgraphs and orientations

DOI10.1016/j.disc.2020.111842zbMath1437.05101arXiv1905.06215OpenAlexW3005342614MaRDI QIDQ2174586

Márton Borbényi, Péter Csikvári

Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.06215

zbMATH Keywords

gauge transformationsEulerian orientationshalf graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Random cluster model on regular graphs ⋮ Covers, orientations and factors ⋮ A short survey on stable polynomials, orientations and matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Holographic algorithms: from art to science
• Bounds on the number of Eulerian orientations
• Basis collapse in holographic algorithms
• Expressiveness of matchgates.
• Holographic algorithms without matchgates
• Loop calculus in statistical physics and information science
• Loop series for discrete statistical models on graphs
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Holographic Algorithms
• On Symmetric Signatures in Holographic Algorithms
• Complexity Dichotomies for Counting Problems
• Tree-based reparameterization framework for analysis of sum-product and related algorithms
• Holographic Algorithms: The Power of Dimensionality Resolved

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