Sparsity matroid
id:
sparsity-matroid-167-13012073
title:
Sparsity matroid
text:
A sparsity matroid is a mathematical structure that captures how densely a multigraph is populated with edges. To unpack this a little, sparsity is a measure of density of a graph that bounds the number of edges in any subgraph. The property of having a particular matroid as its density measure is invariant under graph isomorphisms and so it is a graph invariant. The graphs we are concerned with generalise simple directed graphs by allowing multiple same-oriented edges between pairs of vertices.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Sparsity_matroid
date created:
2021-01-22T19:33:36Z
date modified:
2024-08-30T11:58:10Z
main entity:
{"identifier":"Q111954652","url":"https://www.wikidata.org/entity/Q111954652"}
image:
fields total:
13
integrity:
14