Bounding the number of bases of a matroid

DOI10.1016/j.disc.2021.112636zbMath1476.05079OpenAlexW3203137769MaRDI QIDQ5919124

James G. Oxley, James Dylan Douthitt

Publication date: 27 October 2021

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

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112636

zbMATH Keywords

spanning treematroid basismatroid cocircuit

Mathematics Subject Classification ID

Trees (05C05) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Enumeration in graph theory (05C30) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Spanning trees and orientation of graphs
• The number of spanning trees in regular graphs
• SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
• The number of spanning trees in graphs with a given degree sequence
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding the number of bases of a matroid