| http://dbpedia.org/ontology/abstract
|
In the mathematical theory of matroids, a … 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.t almost all matroids are paving matroids.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Vamos_matroid.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://web.archive.org/web/20120617054952/http:/www.math.uwaterloo.ca/~jfgeelen/publications/paving.pdf +
, http://www.math.uwaterloo.ca/~jfgeelen/publications/paving.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
37729421
|
| http://dbpedia.org/ontology/wikiPageLength
|
6923
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1093649042
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Uniform_matroid +
, http://dbpedia.org/resource/V%C3%A1mos_matroid +
, http://dbpedia.org/resource/Fano_plane +
, http://dbpedia.org/resource/Complete_graph +
, http://dbpedia.org/resource/Henry_Crapo_%28mathematician%29 +
, http://dbpedia.org/resource/Family_of_sets +
, http://dbpedia.org/resource/Oxford_University_Press +
, http://dbpedia.org/resource/Almost_all +
, http://dbpedia.org/resource/Steiner_system +
, http://dbpedia.org/resource/Rota%27s_basis_conjecture +
, http://dbpedia.org/resource/Cycle_matroid +
, http://dbpedia.org/resource/Matroid +
, http://dbpedia.org/resource/Combinatorial_enumeration +
, http://dbpedia.org/resource/Mathematical +
, http://dbpedia.org/resource/Gian-Carlo_Rota +
, http://dbpedia.org/resource/Finite_set +
, http://dbpedia.org/resource/Category:Matroid_theory +
, http://dbpedia.org/resource/File:Vamos_matroid.svg +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Sfnp +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Citation +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Matroid_theory +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Paving_matroid?oldid=1093649042&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Vamos_matroid.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Paving_matroid +
|
| owl:sameAs |
https://global.dbpedia.org/id/4tDYf +
, http://www.wikidata.org/entity/Q7155894 +
, http://rdf.freebase.com/ns/m.0nfwfjx +
, http://dbpedia.org/resource/Paving_matroid +
|
| rdfs:comment |
In the mathematical theory of matroids, a … 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.t almost all matroids are paving matroids.
|
| rdfs:label |
Paving matroid
|
