Pages that link to "Item:Q5735191"
From MaRDI portal
The following pages link to The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones (Q5735191):
Displaying 18 items.
- Every 7-regular digraph contains an even cycle (Q1123202) (← links)
- Representing matrices (Q1146676) (← links)
- Triangular (0,1)-matrices with prescribed row and column sums (Q1164689) (← links)
- A proof of Fulkerson's characterization of permutation matrices (Q1221117) (← links)
- Some combinatorial properties of centrosymmetric matrices (Q1234335) (← links)
- Wide partitions, Latin tableaux, and Rota's basis conjecture (Q1415381) (← links)
- Convex sets of doubly stochastic matrices (Q1843474) (← links)
- Singular values, doubly stochastic matrices, and applications (Q1893086) (← links)
- Expected utility and the Siegel paradox: A generalization (Q2366129) (← links)
- Investigations on an edge coloring problem (Q2546513) (← links)
- Complexity of a disjoint matching problem on bipartite graphs (Q2629777) (← links)
- Additive decomposition of nonnegative matrices with applications to permanents and scalingt (Q3784979) (← links)
- Disjoint permutation matrices in complements of trees (Q3867923) (← links)
- Transversal matroid intersections and related packings (Q4126086) (← links)
- Blocking and anti-blocking pairs of polyhedra (Q5668263) (← links)
- On the separation power and the completion of partial latin squares (Q5904365) (← links)
- On the separation power and the completion of partial latin squares (Q5904487) (← links)
- Systems of representatives (Q5920823) (← links)
