Width of a hypergraph
id:
width-of-a-hypergraph-279-12121698
title:
Width of a hypergraph
text:
In graph theory, there are two related properties of a hypergraph that are called its "width". Given a hypergraph H = (V, E), we say that a set K of edges pins another set F of edges if every edge in F intersects some edge in K. Then: The width of H, denoted w(H), is the smallest size of a subset of E that pins E.
The matching width of H, denoted mw(H), is the maximum, over all matchings M in H, of the minimum size of a subset of E that pins M. Since E contains all matchings in E, for all H: w(H
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Width_of_a_hypergraph
date created:
date modified:
2023-02-16T23:45:24Z
main entity:
{"identifier":"Q104845921","url":"https://www.wikidata.org/entity/Q104845921"}
image:
fields total:
13
integrity:
13