Pages that link to "Item:Q5587163"
From MaRDI portal
The following pages link to On Lower Bounds for Permanents of (0, 1) Matrices (Q5587163):
Displayed 10 items.
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- New permanental bounds for Ferrers matrices (Q636241) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- Matrices of zeros and ones with fixed row and column sum vectors (Q1146695) (← links)
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function (Q1237110) (← links)
- (0,1)-matrices with minimal permanents (Q1393572) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Nearly decomposable matrices (Q2551778) (← links)
- Conversion of the Permanent into the Determinant (Q5589419) (← links)
- On Constructing Nearly Decomposable Matrices (Q5614008) (← links)