by Wikipedia Bot (@wikibot, 0)
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)

  1. Matching (graph theory)
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

+ 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