A Blass-Sagan bijection on Eulerian equivalence classes

2007/06/22 by Beifang Chen, Chen, Beifang, Arthur L. B. Yang +3
Mathematics · #05A99 #05C20 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.0706.3263

openalex publication_date 2007/06/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of totally cyclic orientations and the spanning trees without internal activity edges for a given graph.

Citations

• Acyclic orientations of graphs
• A Contribution to the Theory of Chromatic Polynomials

Related

• A tree bijection for Eulerian orientations on quartic maps
• The active bijection for graphs
• Geometric bijections between spanning subgraphs and orientations of a graph
• Counting degree-constrained subgraphs and orientations
• Bijective Proofs for "Enumerative Properties of Ferrers Graphs"