Matrix choosability

DOI10.1006/jcta.1999.3026zbMath0966.15003OpenAlexW2914164509MaRDI QIDQ1976325

Matt DeVos

Publication date: 16 August 2001

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a18496f9ccbbfe30e8ec095bd699f9a013f8c022

zbMATH Keywords

flows in graphsgeneralized permanentpliant matrix

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Linear equations (linear algebraic aspects) (15A06)

Related Items (4)

Essential positive covers of the cube ⋮ Additive bases and flows in graphs ⋮ Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices ⋮ Additive Bases and Flows in Graphs

Cites Work

• Unnamed Item
• A nowhere-zero point in linear mappings
• Flows and generalized coloring theorems in graphs
• Additive bases of vector spaces over prime fields
• Colorings and orientations of graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• The permanent rank of a matrix
• Edge-Disjoint Spanning Trees of Finite Graphs
• Combinatorial Nullstellensatz
• Minimum partition of a matroid into independent subsets

This page was built for publication: Matrix choosability