Bounds on the number of Eulerian orientations
From MaRDI portal
Publication:787162
DOI10.1007/BF02579193zbMATH Open0529.05031WikidataQ56227294 ScholiaQ56227294MaRDI QIDQ787162FDOQ787162
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Eulerian and Hamiltonian graphs (05C45) Determinants, permanents, traces, other special matrix functions (15A15) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- A short proof of Minc's conjecture
- Title not available (Why is that?)
- The solution of van der Waerden's problem for permanents
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notes on Egoritsjev's proof of the van der Waerden conjecture
- A Permanent Inequality
- On the Permanent of a Doubly Stochastic Matrix
Cited In (9)
- Counting degree-constrained subgraphs and orientations
- A short survey on stable polynomials, orientations and matchings
- Bounding the number of Eulerian tours in undirected graphs
- Factor-of-iid balanced orientation of non-amenable graphs
- Refined bounds on the number of Eulerian tours in undirected graphs
- Covers, orientations and factors
- Asymptotic behavior of the number of Eulerian orientations of graphs
- On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs
- 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)
