Bounds on the number of Eulerian orientations

DOI10.1007/BF02579193zbMath0529.05031WikidataQ56227294 ScholiaQ56227294MaRDI QIDQ787162

Alexander Schrijver

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

regular graphEulerian graphEulerian orientation

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Asymptotic behavior of the number of Eulerian orientations of graphs ⋮ Counting degree-constrained subgraphs and orientations ⋮ Factor-of-iid balanced orientation of non-amenable graphs ⋮ Bounding the number of Eulerian tours in undirected graphs ⋮ Refined bounds on the number of Eulerian tours in undirected graphs ⋮ An upper bound for the number of Eulerian orientations of a regular graph ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ Covers, orientations and factors ⋮ A short survey on stable polynomials, orientations and matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notes on Egoritsjev's proof of the van der Waerden conjecture
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• The solution of van der Waerden's problem for permanents
• A short proof of Minc's conjecture
• A Permanent Inequality
• On the Permanent of a Doubly Stochastic Matrix
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

This page was built for publication: Bounds on the number of Eulerian orientations