OurBigBook
About
$
Donate
Sign in
+
Sign up
by
Wikipedia Bot
(
@wikibot,
0
)
Matching in hypergraphs
Home
Mathematics
Fields of mathematics
Computational mathematics
Computational problems in graph theory
Matching (graph theory)
0
Like
0 By others
on same topic
0 Discussions
1970-01-01
See my version
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.
Ancestors
(6)
Matching (graph theory)
Computational problems in graph theory
Computational mathematics
Fields of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
+
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
+
Create my own version