Lesson plan
Hypergraph
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, or elements and E is a set of pairs of subsets of X . Each of these pairs (D,C)\in E is called an edge or hyperedge; the vertex subset D is known as its tail or domain, and C as its head or codomain. The order of a hypergraph (X,E) is the number of vertices in X . The size of the hypergraph is the number of edges in E . The order of an edge e=(D,C) in a directed hypergraph is |e| = (|D|,|C|) : that is, the number of vertices in its tail followed by the number of vertices in its head. The definition above generalizes from a directed graph to a directed hypergraph by defining the head or tail of each edge as a set of vertices ( C\subseteq X or D\subseteq X ) rather than as a single vertex. A graph is then the special case where each of these sets contains only one element. Hence any standard graph theoretic concept that is independent of the edge orders |e| will generalize to hypergraph theory.…
Article summary
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, or elements and E is a set of pairs of subsets of X . Each of these pairs (D,C)\in E is called an edge or hyperedge; the vertex subset D is known as its tail or domain, and C as its head or codomain. The order of a hypergraph (X,E) is the number of vertices in X . The size of the hypergraph is the number of edges in E . The order of an edge e=(D,C) in a directed hypergraph is |e| = (|D|,|C|) : that is, the number of vertices in its tail followed by the number of vertices in its head. The definition above generalizes from a directed graph to a directed hypergraph by defining the head or tail of each edge as a set of vertices ( C\subseteq X or D\subseteq X ) rather than as a single vertex. A graph is then the special case where each of these sets contains only one element. Hence any standard graph theoretic concept that is independent of the edge orders |e| will generalize to hypergraph theory.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.