The diagonal hypergraph of a matrix (bipartite graph)

DOI10.1016/0012-365X(79)90105-5zbMath0441.05037MaRDI QIDQ1142788

Richard A. Brualdi

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

separable setpositive diagonaldiagonal hypergraphseparability number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Matrices with isomorphic diagonal hypergraphs ⋮ Isolated sets of diagonals, diagonal hypergraphs, and simplices of doubly stochastic matrices ⋮ Linear preservers and diagonal hypergraphs ⋮ Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices

Cites Work

• Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
• Regularisable Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The diagonal hypergraph of a matrix (bipartite graph)