| Display title | Hypergraph |
| Default sort key | Hypergraph |
| Page length (in bytes) | 48,294 |
| Namespace ID | 0 |
| Page ID | 302308 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>NBrushPhys |
| Date of page creation | 00:24, 7 February 2024 |
| Latest editor | imported>NBrushPhys |
| Date of latest edit | 00:24, 7 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two vertices.
Formally, a directed hypergraph is a pair $ (X,E) $, where $ X $ is a set of elements called nodes, vertices, points... |
