Bounding the number of bases of a matroid
Copyright policy )Bounding the number of bases of a matroid
The possibility of bounding the number of bases of a matroid by a polynomial of the size \(k\) of the underlying set, or by a polynomial of the size of \(k\) times the number of circuits, is investigated. The latter holds for every member of a minor closed class of matroids if and only if the class does not contain the direct sum of an arbitrarily large number of length 2 circuits. The same condition is shown for the former question, too, if every member of the class is representable over a fixed finite field.
- Louisiana State University United States
polynomial, circuits, Generalized Ramsey theory, matroid, bases, Combinatorial aspects of matroids and geometric lattices, minor closed class, Planar graphs; geometric and topological aspects of graph theory
polynomial, circuits, Generalized Ramsey theory, matroid, bases, Combinatorial aspects of matroids and geometric lattices, minor closed class, Planar graphs; geometric and topological aspects of graph theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!