Bounds on the number of Eulerian orientations

DOI10.1007/BF02579193MaRDI QIDQ787162zbMATH OpenWikidataFDO

Authors Alexander Schrijver

Publication date 1983

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Eulerian graphregular graphEulerian orientation

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3704754 (Why is no real title available?)
• scientific article; zbMATH DE number 3458807 (Why is no real title available?)
• scientific article; zbMATH DE number 3621721 (Why is no real title available?)
• scientific article; zbMATH DE number 3277547 (Why is no real title available?)
• A Permanent Inequality
• A short proof of Minc's conjecture
• Notes on Egoritsjev's proof of the van der Waerden conjecture
• On the Permanent of a Doubly Stochastic Matrix
• 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
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

Cited in

(9)

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

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

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