Maximal nests of subspaces, the matrix Bruhat decomposition, and the marriage theorem - with an application to graph coloring

DOI10.13001/1081-3810.1078zbMath1019.05019OpenAlexW2150129886MaRDI QIDQ4706970

Richard A. Brualdi

Publication date: 22 June 2003

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122821

zbMATH Keywords

matroidsgraph coloringsmarriage theoremnests of subspacesmatrix Bruhat decomposition

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (1)

Some Combinatorially Defined Matrix Classes

This page was built for publication: Maximal nests of subspaces, the matrix Bruhat decomposition, and the marriage theorem - with an application to graph coloring