A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean

DOI10.1016/S0195-6698(84)80003-7zbMath0549.05017OpenAlexW1987683162MaRDI QIDQ800365

Kenneth A. Berman

Publication date: 1984

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(84)80003-7

zbMATH Keywords

digraphsbinary matroidsbinary matroidmatroid theoremweighted matrix-tree theorem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning arborescences, ingraphs, and outgraphs
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
• On the Principal Edge Tripartition of a Graph
• On Vector Spaces Associated with a Graph
• Lectures on matroids
• Graph property recognition machines
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH

This page was built for publication: A generalization to bases common to r binary matroids of the weighted matrix-tree theorem in the case when the weights are Boolean