Paving matroid
id:
paving-matroid-247-16744793
title:
Paving matroid
text:
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 r every circuit has size at most r + 1 , so it is equivalent to define paving matroids as the matroids in which the size of every circuit belongs to the set { r , r + 1 } . It has been conjectured that almost all matroids are paving matroids.
brand slug:
wiki
category slug:
encyclopedia
description:
Matroid without short circuits
original url:
https://en.wikipedia.org/wiki/Paving_matroid
date created:
date modified:
2023-05-03T10:42:38Z
main entity:
{"identifier":"Q7155894","url":"https://www.wikidata.org/entity/Q7155894"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b7/Vamos_matroid.svg","width":225,"height":315}
fields total:
13
integrity:
15