Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Paving_matroid> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Paving_matroid abstract "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 .".
- Paving_matroid thumbnail Vamos_matroid.svg?width=300.
- Paving_matroid wikiPageExternalLink paving.pdf.
- Paving_matroid wikiPageID "37729421".
- Paving_matroid wikiPageRevisionID "591825199".
- Paving_matroid hasPhotoCollection Paving_matroid.
- Paving_matroid subject Category:Matroid_theory.
- Paving_matroid comment "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 .".
- Paving_matroid label "Paving matroid".
- Paving_matroid sameAs m.0nfwfjx.
- Paving_matroid sameAs Q7155894.
- Paving_matroid sameAs Q7155894.
- Paving_matroid wasDerivedFrom Paving_matroid?oldid=591825199.
- Paving_matroid depiction Vamos_matroid.svg.
- Paving_matroid isPrimaryTopicOf Paving_matroid.
