SiGMa 2017 Jorn van der Pol, Almost every matroid is almost asymmetric
In the mathematical theory of matroids, a paving matroid is a matroid in which every circuit has size at least as large as the matroid's rank. In a matroid of rank
every circuit has size at most
, so it is equivalent to define paving matroids as the matroids in which the size of every circuit belongs to the set
. It has been conjectured that almost all matroids are paving matroids.
Explore contextually related video stories in a new eye-catching way. Try Combster now!