Matroid girth
id:
matroid-girth-271-4798946
title:
Matroid girth
text:
In matroid theory, a mathematical discipline, the girth of a matroid is the size of its smallest circuit or dependent set. The cogirth of a matroid is the girth of its dual matroid. Matroid girth generalizes the notion of the shortest cycle in a graph, the edge connectivity of a graph, Hall sets in bipartite graphs, even sets in families of sets, and general position of point sets. It is hard to compute, but fixed-parameter tractable for linear matroids when parameterized both by the matroid ran
brand slug:
wiki
category slug:
encyclopedia
description:
Abstraction of graph shortest cycles
original url:
https://en.wikipedia.org/wiki/Matroid_girth
date created:
date modified:
2022-06-18T19:55:48Z
main entity:
{"identifier":"Q25304058","url":"https://www.wikidata.org/entity/Q25304058"}
image:
fields total:
13
integrity:
14