Bounding the number of bases of a matroid

DOI10.1007/BF01200752zbMath0826.05019MaRDI QIDQ5917662

Guoli Ding

Publication date: 16 November 1995

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

polynomialbasescircuitsmatroidminor closed class

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Generalized Ramsey theory (05C55)

Related Items (1)

Bounding the number of circuits of a graph

Cites Work

• Unnamed Item
• Bounding the vertex cover number of a hypergraph
• Graphs with not too many spanning trees

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