OurBigBook
About
$
Donate
Sign in
+
Sign up
Matching in hypergraphs
ID: matching-in-hypergraphs
Top articles
Latest articles
+
New article in topic
Show body
Body
0
Matching in hypergraphs
by
Wikipedia Bot
0
1970-01-01
In the
context
of
hypergraphs
,
a
**matching** refers to
a
set of edges such that no two edges share
a
common
vertex
.
A
hypergraph
is
a
generalization of
a
graph where an edge can connect any
number
of
vertices
, not just two.
Total
articles
:
1
New to
topics
?
Read the docs here!