超图 Hypergraph

我们在组织翻译超图这个词条，这个词条是之前Wolfram发的那篇长文中一个非常重要的概念，我们希望可以整理好这个词条，帮助大家更好的理解那篇文章。

现在招募6个小伙伴一起翻译超图这个词条 https://wiki.swarma.org/index.php?title=超图_Hypergraph

• 开头正文部分+术语定义（Terminology)——十三维
• 二分图模型+不对称性+同构与平等——淑慧
• 对称超图+横截面
• 关联矩阵+超图着色+分区
• 定理+超图绘制+超图语法
• 概括+超图学习——世康

截止时间：北京时间18：00之前。

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 hypergraph [math]\displaystyle{ H }[/math] is a pair [math]\displaystyle{ H = (X,E) }[/math] where [math]\displaystyle{ X }[/math] is a set of elements called nodes or vertices, and [math]\displaystyle{ E }[/math] is a set of non-empty subsets of [math]\displaystyle{ X }[/math] called hyperedges or edges. Therefore, [math]\displaystyle{ E }[/math] is a subset of [math]\displaystyle{ \mathcal{P}(X) \setminus\{\emptyset\} }[/math], where [math]\displaystyle{ \mathcal{P}(X) }[/math] is the power set of [math]\displaystyle{ X }[/math]. The size of the vertex set is called the order of the hypergraph, and the size of edges set is the size of the hypergraph.

While graph edges are 2-element subsets of nodes, hyperedges are arbitrary sets of nodes, and can therefore contain an arbitrary number of nodes. However, it is often desirable to study hypergraphs where all hyperedges have the same cardinality; a k-uniform hypergraph is a hypergraph such that all its hyperedges have size k. (In other words, one such hypergraph is a collection of sets, each such set a hyperedge connecting k nodes.) So a 2-uniform hypergraph is a graph, a 3-uniform hypergraph is a collection of unordered triples, and so on. A hypergraph is also called a set system or a family of sets drawn from the universal set.

Hypergraphs can be viewed as incidence structures. In particular, there is a bipartite "incidence graph" or "Levi graph" corresponding to every hypergraph, and conversely, most, but not all, bipartite graphs can be regarded as incidence graphs of hypergraphs.

Hypergraphs have many other names. In computational geometry, a hypergraph may sometimes be called a range space and then the hyperedges are called ranges. In cooperative game theory, hypergraphs are called simple games (voting games); this notion is applied to solve problems in social choice theory. In some literature edges are referred to as hyperlinks or connectors.

Special kinds of hypergraphs include: k-uniform ones, as discussed briefly above; clutters, where no edge appears as a subset of another edge; and abstract simplicial complexes, which contain all subsets of every edge.

The collection of hypergraphs is a category with hypergraph homomorphisms as morphisms.

Terminology

Definitions

There are different types of hypergraphs such as:

• Empty hypergraph: a hypergraph with no edges.
• Non-simple (or multiple) hypergraph: a hypergraph allowing loops (hyperedges with a single vertex) or repeated edges, which means there can be two or more edges containing the same set of vertices.
• Simple hypergraph: a hypergraph that contains no loops and no repeated edges.
• [math]\displaystyle{ k }[/math]-uniform hypergraph: a hypergraph where each edge contains precisely [math]\displaystyle{ k }[/math] vertices.
• [math]\displaystyle{ d }[/math]-regular hypergraph: a hypergraph where every vertex has degree [math]\displaystyle{ d }[/math].
• Acyclic hypergraph: a hypergraph that does not contain any cycles.

Because hypergraph links can have any cardinality, there are several notions of the concept of a subgraph, called subhypergraphs, partial hypergraphs and section hypergraphs.

Let [math]\displaystyle{ H=(X,E) }[/math] be the hypergraph consisting of vertices

[math]\displaystyle{ X = \lbrace x_i | i \in I_v \rbrace, }[/math]

and having edge set

[math]\displaystyle{ E = \lbrace e_i | i\in I_e \land e_i \subseteq X \land e_i \neq \emptyset \rbrace, }[/math]

where [math]\displaystyle{ I_v }[/math] and [math]\displaystyle{ I_e }[/math] are the index sets of the vertices and edges respectively.

A subhypergraph is a hypergraph with some vertices removed. Formally, the subhypergraph [math]\displaystyle{ H_A }[/math] induced by [math]\displaystyle{ A \subseteq X }[/math] is defined as

[math]\displaystyle{ H_A=\left(A, \lbrace e \cap A | e \in E \land e \cap A \neq \emptyset \rbrace \right). }[/math]

An extension of a subhypergraph is a hypergraph where each hyperedge of [math]\displaystyle{ H }[/math] which is partially contained in the subhypergraph [math]\displaystyle{ H_A }[/math] and is fully contained in the extension [math]\displaystyle{ Ex(H_A) }[/math]. Formally

[math]\displaystyle{ Ex(H_A) = (A \cup A', E' ) }[/math] with [math]\displaystyle{ A' = \bigcup_{e \in E} e \setminus A }[/math] and [math]\displaystyle{ E' = \lbrace e \in E | e \subseteq (A \cup A') \rbrace }[/math].

The partial hypergraph is a hypergraph with some edges removed. Given a subset [math]\displaystyle{ J \subset I_e }[/math] of the edge index set, the partial hypergraph generated by [math]\displaystyle{ J }[/math] is the hypergraph

[math]\displaystyle{ \left(X, \lbrace e_i | i\in J \rbrace \right). }[/math]

Given a subset [math]\displaystyle{ A\subseteq X }[/math], the section hypergraph is the partial hypergraph

[math]\displaystyle{ H \times A = \left(A, \lbrace e_i | i\in I_e \land e_i \subseteq A \rbrace \right). }[/math]

The dual [math]\displaystyle{ H^* }[/math] of [math]\displaystyle{ H }[/math] is a hypergraph whose vertices and edges are interchanged, so that the vertices are given by [math]\displaystyle{ \lbrace e_i \rbrace }[/math] and whose edges are given by [math]\displaystyle{ \lbrace X_m \rbrace }[/math] where

[math]\displaystyle{ X_m = \lbrace e_i | x_m \in e_i \rbrace. }[/math]

When a notion of equality is properly defined, as done below, the operation of taking the dual of a hypergraph is an involution, i.e.,

[math]\displaystyle{ \left(H^*\right)^* = H. }[/math]

A connected graph G with the same vertex set as a connected hypergraph H is a host graph for H if every hyperedge of H induces a connected subgraph in G. For a disconnected hypergraph H, G is a host graph if there is a bijection between the connected components of G and of H, such that each connected component G' of G is a host of the corresponding H'.

A hypergraph is bipartite if and only if its vertices can be partitioned into two classes U and V in such a way that each hyperedge with cardinality at least 2 contains at least one vertex from both classes. Alternatively, such a hypergraph is said to have Property B.

The 2-section (or clique graph, representing graph, primal graph, Gaifman graph) of a hypergraph is the graph with the same vertices of the hypergraph, and edges between all pairs of vertices contained in the same hyperedge.

Bipartite graph model

A hypergraph H may be represented by a bipartite graph BG as follows: the sets X and E are the partitions of BG, and (x₁, e₁) are connected with an edge if and only if vertex x₁ is contained in edge e₁ in H. Conversely, any bipartite graph with fixed parts and no unconnected nodes in the second part represents some hypergraph in the manner described above. This bipartite graph is also called incidence graph.

Acyclicity

In contrast with ordinary undirected graphs for which there is a single natural notion of cycles and acyclic graphs, there are multiple natural non-equivalent definitions of acyclicity for hypergraphs which collapse to ordinary graph acyclicity for the special case of ordinary graphs.

A first definition of acyclicity for hypergraphs was given by Claude Berge: a hypergraph is Berge-acyclic if its incidence graph (the bipartite graph defined above) is acyclic. This definition is very restrictive: for instance, if a hypergraph has some pair [math]\displaystyle{ v \neq v' }[/math] of vertices and some pair [math]\displaystyle{ f \neq f' }[/math] of hyperedges such that [math]\displaystyle{ v, v' \in f }[/math] and [math]\displaystyle{ v, v' \in f' }[/math], then it is Berge-cyclic. Berge-cyclicity can obviously be tested in linear time by an exploration of the incidence graph.

We can define a weaker notion of hypergraph acyclicity, later termed α-acyclicity. This notion of acyclicity is equivalent to the hypergraph being conformal (every clique of the primal graph is covered by some hyperedge) and its primal graph being chordal; it is also equivalent to reducibility to the empty graph through the GYO algorithm (also known as Graham's algorithm), a confluent iterative process which removes hyperedges using a generalized definition of ears. In the domain of database theory, it is known that a database schema enjoys certain desirable properties if its underlying hypergraph is α-acyclic. Besides, α-acyclicity is also related to the expressiveness of the guarded fragment of first-order logic.

We can test in linear time if a hypergraph is α-acyclic.

Note that α-acyclicity has the counter-intuitive property that adding hyperedges to an α-cyclic hypergraph may make it α-acyclic (for instance, adding a hyperedge containing all vertices of the hypergraph will always make it α-acyclic). Motivated in part by this perceived shortcoming, Ronald Fagin defined the stronger notions of β-acyclicity and γ-acyclicity. We can state β-acyclicity as the requirement that all subhypergraphs of the hypergraph are α-acyclic, which is equivalent to an earlier definition by Graham. The notion of γ-acyclicity is a more restrictive condition which is equivalent to several desirable properties of database schemas and is related to Bachman diagrams. Both β-acyclicity and γ-acyclicity can be tested in polynomial time.

Those four notions of acyclicity are comparable: Berge-acyclicity implies γ-acyclicity which implies β-acyclicity which implies α-acyclicity. However, none of the reverse implications hold, so those four notions are different.

Isomorphism and equality

A hypergraph homomorphism is a map from the vertex set of one hypergraph to another such that each edge maps to one other edge.

A hypergraph [math]\displaystyle{ H=(X,E) }[/math] is isomorphic to a hypergraph [math]\displaystyle{ G=(Y,F) }[/math], written as [math]\displaystyle{ H \simeq G }[/math] if there exists a bijection

[math]\displaystyle{ \phi:X \to Y }[/math]

and a permutation [math]\displaystyle{ \pi }[/math] of [math]\displaystyle{ I }[/math] such that

[math]\displaystyle{ \phi(e_i) = f_{\pi(i)} }[/math]

The bijection [math]\displaystyle{ \phi }[/math] is then called the isomorphism of the graphs. Note that

[math]\displaystyle{ H \simeq G }[/math] if and only if [math]\displaystyle{ H^* \simeq G^* }[/math].

When the edges of a hypergraph are explicitly labeled, one has the additional notion of strong isomorphism. One says that [math]\displaystyle{ H }[/math] is strongly isomorphic to [math]\displaystyle{ G }[/math] if the permutation is the identity. One then writes [math]\displaystyle{ H \cong G }[/math]. Note that all strongly isomorphic graphs are isomorphic, but not vice versa.

When the vertices of a hypergraph are explicitly labeled, one has the notions of equivalence, and also of equality. One says that [math]\displaystyle{ H }[/math] is equivalent to [math]\displaystyle{ G }[/math], and writes [math]\displaystyle{ H\equiv G }[/math] if the isomorphism [math]\displaystyle{ \phi }[/math] has

[math]\displaystyle{ \phi(x_n) = y_n }[/math]

and

[math]\displaystyle{ \phi(e_i) = f_{\pi(i)} }[/math]

Note that

[math]\displaystyle{ H\equiv G }[/math] if and only if [math]\displaystyle{ H^* \cong G^* }[/math]

If, in addition, the permutation [math]\displaystyle{ \pi }[/math] is the identity, one says that [math]\displaystyle{ H }[/math] equals [math]\displaystyle{ G }[/math], and writes [math]\displaystyle{ H=G }[/math]. Note that, with this definition of equality, graphs are self-dual:

[math]\displaystyle{ \left(H^*\right) ^* = H }[/math]

A hypergraph automorphism is an isomorphism from a vertex set into itself, that is a relabeling of vertices. The set of automorphisms of a hypergraph H (= (X, E)) is a group under composition, called the automorphism group of the hypergraph and written Aut(H).

Examples

Consider the hypergraph [math]\displaystyle{ H }[/math] with edges

[math]\displaystyle{ H = \lbrace e_1 = \lbrace a,b \rbrace, e_2 = \lbrace b,c \rbrace, e_3 = \lbrace c,d \rbrace, e_4 = \lbrace d,a \rbrace, e_5 = \lbrace b,d \rbrace, e_6 = \lbrace a,c \rbrace \rbrace }[/math]

and

[math]\displaystyle{ G = \lbrace f_1 = \lbrace \alpha,\beta \rbrace, f_2 = \lbrace \beta,\gamma \rbrace, f_3 = \lbrace \gamma,\delta \rbrace, f_4 = \lbrace \delta,\alpha \rbrace, f_5 = \lbrace \alpha,\gamma \rbrace, f_6 = \lbrace \beta,\delta \rbrace \rbrace }[/math]

Then clearly [math]\displaystyle{ H }[/math] and [math]\displaystyle{ G }[/math] are isomorphic (with [math]\displaystyle{ \phi(a)=\alpha }[/math], etc.), but they are not strongly isomorphic. So, for example, in [math]\displaystyle{ H }[/math], vertex [math]\displaystyle{ a }[/math] meets edges 1, 4 and 6, so that,

[math]\displaystyle{ e_1 \cap e_4 \cap e_6 = \lbrace a\rbrace }[/math]

In graph [math]\displaystyle{ G }[/math], there does not exist any vertex that meets edges 1, 4 and 6:

[math]\displaystyle{ f_1 \cap f_4 \cap f_6 = \varnothing }[/math]

In this example, [math]\displaystyle{ H }[/math] and [math]\displaystyle{ G }[/math] are equivalent, [math]\displaystyle{ H\equiv G }[/math], and the duals are strongly isomorphic: [math]\displaystyle{ H^*\cong G^* }[/math].

Symmetric hypergraphs

The 模板:Visible anchor [math]\displaystyle{ r(H) }[/math] of a hypergraph [math]\displaystyle{ H }[/math] is the maximum cardinality of any of the edges in the hypergraph. If all edges have the same cardinality k, the hypergraph is said to be uniform or k-uniform, or is called a k-hypergraph. A graph is just a 2-uniform hypergraph.

The degree d(v) of a vertex v is the number of edges that contain it. H is k-regular if every vertex has degree k.

The dual of a uniform hypergraph is regular and vice versa.

Two vertices x and y of H are called symmetric if there exists an automorphism such that [math]\displaystyle{ \phi(x)=y }[/math]. Two edges [math]\displaystyle{ e_i }[/math] and [math]\displaystyle{ e_j }[/math] are said to be symmetric if there exists an automorphism such that [math]\displaystyle{ \phi(e_i)=e_j }[/math].

A hypergraph is said to be vertex-transitive (or vertex-symmetric) if all of its vertices are symmetric. Similarly, a hypergraph is edge-transitive if all edges are symmetric. If a hypergraph is both edge- and vertex-symmetric, then the hypergraph is simply transitive.

Because of hypergraph duality, the study of edge-transitivity is identical to the study of vertex-transitivity.

Transversals

A transversal (or "hitting set") of a hypergraph H = (X, E) is a set [math]\displaystyle{ T\subseteq X }[/math] that has nonempty intersection with every edge. A transversal T is called minimal if no proper subset of T is a transversal. The transversal hypergraph of H is the hypergraph (X, F) whose edge set F consists of all minimal transversals of H.

Computing the transversal hypergraph has applications in combinatorial optimization, in game theory, and in several fields of computer science such as machine learning, indexing of databases, the satisfiability problem, data mining, and computer program optimization.

Incidence matrix

Let [math]\displaystyle{ V = \{v_1, v_2, ~\ldots, ~ v_n\} }[/math] and [math]\displaystyle{ E = \{e_1, e_2, ~ \ldots ~ e_m\} }[/math]. Every hypergraph has an [math]\displaystyle{ n \times m }[/math] incidence matrix [math]\displaystyle{ A = (a_{ij}) }[/math] where

[math]\displaystyle{ a_{ij} = \left\{ \begin{matrix} 1 & \mathrm{if} ~ v_i \in e_j \\ 0 & \mathrm{otherwise}. \end{matrix} \right. }[/math]

The transpose [math]\displaystyle{ A^t }[/math] of the incidence matrix defines a hypergraph [math]\displaystyle{ H^* = (V^*,\ E^*) }[/math] called the dual of [math]\displaystyle{ H }[/math], where [math]\displaystyle{ V^* }[/math] is an m-element set and [math]\displaystyle{ E^* }[/math] is an n-element set of subsets of [math]\displaystyle{ V^* }[/math]. For [math]\displaystyle{ v^*_j \in V^* }[/math] and [math]\displaystyle{ e^*_i \in E^*, ~ v^*_j \in e^*_i }[/math] if and only if [math]\displaystyle{ a_{ij} = 1 }[/math].

Hypergraph coloring

Classic hypergraph coloring is assigning one of the colors from set [math]\displaystyle{ \{1,2,3,...\lambda\} }[/math] to every vertex of a hypergraph in such a way that each hyperedge contains at least two vertices of distinct colors. In other words, there must be no monochromatic hyperedge with cardinality at least 2. In this sense it is a direct generalization of graph coloring. Minimum number of used distinct colors over all colorings is called the chromatic number of a hypergraph.

Hypergraphs for which there exists a coloring using up to k colors are referred to as k-colorable. The 2-colorable hypergraphs are exactly the bipartite ones.

There are many generalizations of classic hypergraph coloring. One of them is the so-called mixed hypergraph coloring, when monochromatic edges are allowed. Some mixed hypergraphs are uncolorable for any number of colors. A general criterion for uncolorability is unknown. When a mixed hypergraph is colorable, then the minimum and maximum number of used colors are called the lower and upper chromatic numbers respectively. See http://spectrum.troy.edu/voloshin/mh.html for details.

Partitions

A partition theorem due to E. Dauber states that, for an edge-transitive hypergraph [math]\displaystyle{ H=(X,E) }[/math], there exists a partition

[math]\displaystyle{ (X_1, X_2,\cdots,X_K) }[/math]

of the vertex set [math]\displaystyle{ X }[/math] such that the subhypergraph [math]\displaystyle{ H_{X_k} }[/math] generated by [math]\displaystyle{ X_k }[/math] is transitive for each [math]\displaystyle{ 1\le k \le K }[/math], and such that

[math]\displaystyle{ \sum_{k=1}^K r\left(H_{X_k} \right) = r(H) }[/math]

where [math]\displaystyle{ r(H) }[/math] is the rank of H.

As a corollary, an edge-transitive hypergraph that is not vertex-transitive is bicolorable.

Graph partitioning (and in particular, hypergraph partitioning) has many applications to IC design and parallel computing. Efficient and Scalable hypergraph partitioning algorithms are also important for processing large scale hypergraphs in machine learning tasks.

Theorems

Many theorems and concepts involving graphs also hold for hypergraphs. Ramsey's theorem and Line graph of a hypergraph are typical examples. Some methods for studying symmetries of graphs extend to hypergraphs.

Two prominent theorems are the Erdős–Ko–Rado theorem and the Kruskal–Katona theorem on uniform hypergraphs.

Hypergraph drawing

This circuit diagram can be interpreted as a drawing of a hypergraph in which four vertices (depicted as white rectangles and disks) are connected by three hyperedges drawn as trees.

Although hypergraphs are more difficult to draw on paper than graphs, several researchers have studied methods for the visualization of hypergraphs.

In one possible visual representation for hypergraphs, similar to the standard graph drawing style in which curves in the plane are used to depict graph edges, a hypergraph's vertices are depicted as points, disks, or boxes, and its hyperedges are depicted as trees that have the vertices as their leaves. If the vertices are represented as points, the hyperedges may also be shown as smooth curves that connect sets of points, or as simple closed curves that enclose sets of points.

文件:Venn's four ellipse construction.svg

An order-4 Venn diagram, which can be interpreted as a subdivision drawing of a hypergraph with 15 vertices (the 15 colored regions) and 4 hyperedges (the 4 ellipses).

In another style of hypergraph visualization, the subdivision model of hypergraph drawing, the plane is subdivided into regions, each of which represents a single vertex of the hypergraph. The hyperedges of the hypergraph are represented by contiguous subsets of these regions, which may be indicated by coloring, by drawing outlines around them, or both. An order-n Venn diagram, for instance, may be viewed as a subdivision drawing of a hypergraph with n hyperedges (the curves defining the diagram) and 2ⁿ − 1 vertices (represented by the regions into which these curves subdivide the plane). In contrast with the polynomial-time recognition of planar graphs, it is NP-complete to determine whether a hypergraph has a planar subdivision drawing, but the existence of a drawing of this type may be tested efficiently when the adjacency pattern of the regions is constrained to be a path, cycle, or tree.

An alternative representation of the hypergraph called PAOH is shown in the figure on top of this article. Edges are vertical lines connecting vertices. Vertices are aligned on the left. The legend on the right shows the names of the edges. It has been designed for dynamic hypergraphs but can be used for simple hypergraphs as well.

Hypergraph grammars

Main article: Hypergraph grammar

By augmenting a class of hypergraphs with replacement rules, graph grammars can be generalised to allow hyperedges.

==Generalizations== 刘世康 One possible generalization of a hypergraph is to allow edges to point at other edges. There are two variations of this generalization. In one, the edges consist not only of a set of vertices, but may also contain subsets of vertices, subsets of subsets of vertices and so on ad infinitum. In essence, every edge is just an internal node of a tree or directed acyclic graph, and vertices are the leaf nodes. A hypergraph is then just a collection of trees with common, shared nodes (that is, a given internal node or leaf may occur in several different trees). Conversely, every collection of trees can be understood as this generalized hypergraph. Since trees are widely used throughout computer science and many other branches of mathematics, one could say that hypergraphs appear naturally as well. So, for example, this generalization arises naturally as a model of term algebra; edges correspond to terms and vertices correspond to constants or variables.

For such a hypergraph, set membership then provides an ordering, but the ordering is neither a partial order nor a preorder, since it is not transitive. The graph corresponding to the Levi graph of this generalization is a directed acyclic graph. Consider, for example, the generalized hypergraph whose vertex set is [math]\displaystyle{ V= \{a,b\} }[/math] and whose edges are [math]\displaystyle{ e_1=\{a,b\} }[/math] and [math]\displaystyle{ e_2=\{a,e_1\} }[/math]. Then, although [math]\displaystyle{ b\in e_1 }[/math] and [math]\displaystyle{ e_1\in e_2 }[/math], it is not true that [math]\displaystyle{ b\in e_2 }[/math]. However, the transitive closure of set membership for such hypergraphs does induce a partial order, and "flattens" the hypergraph into a partially ordered set.

Alternately, edges can be allowed to point at other edges, irrespective of the requirement that the edges be ordered as directed, acyclic graphs. This allows graphs with edge-loops, which need not contain vertices at all. For example, consider the generalized hypergraph consisting of two edges [math]\displaystyle{ e_1 }[/math] and [math]\displaystyle{ e_2 }[/math], and zero vertices, so that [math]\displaystyle{ e_1 = \{e_2\} }[/math] and [math]\displaystyle{ e_2 = \{e_1\} }[/math]. As this loop is infinitely recursive, sets that are the edges violate the axiom of foundation. In particular, there is no transitive closure of set membership for such hypergraphs. Although such structures may seem strange at first, they can be readily understood by noting that the equivalent generalization of their Levi graph is no longer bipartite, but is rather just some general directed graph.

The generalized incidence matrix for such hypergraphs is, by definition, a square matrix, of a rank equal to the total number of vertices plus edges. Thus, for the above example, the incidence matrix is simply

[math]\displaystyle{ \left[ \begin{matrix} 0 & 1 \\ 1 & 0 \end{matrix} \right]. }[/math]

==Hypergraph learning== 刘世康 Hypergraphs have been extensively used in machine learning tasks as the data model and classifier regularization (mathematics). The applications include recommender system (communities as hyperedges), image retrieval (correlations as hyperedges), and bioinformatics (biochemical interactions as hyperedges). Representative hypergraph learning techniques include hypergraph spectral clustering that extends the spectral graph theory with hypergraph Laplacian, and hypergraph semi-supervised learning that introduces extra hypergraph structural cost to restrict the learning results. For large scale hypergraphs, a distributed framework built using Apache Spark is also available.

See also

• Simplicial complex

• Combinatorial design
• Factor graph
• Greedoid
• Incidence structure
• Matroid
• Multigraph
• P system
• Sparse matrix-vector multiplication
• Matching in hypergraphs

References

• Claude Berge, "Hypergraphs: Combinatorics of finite sets". North-Holland, 1989.
• Claude Berge, Dijen Ray-Chaudhuri, "Hypergraph Seminar, Ohio State University 1972", Lecture Notes in Mathematics 411 Springer-Verlag
• 模板:Springer
• Alain Bretto, "Hypergraph Theory: an Introduction", Springer, 2013.
• Vitaly I. Voloshin. "Coloring Mixed Hypergraphs: Theory, Algorithms and Applications". Fields Institute Monographs, American Mathematical Society, 2002.
• Vitaly I. Voloshin. "Introduction to Graph and Hypergraph Theory". Nova Science Publishers, Inc., 2009.
• 模板:PlanetMath attribution

External links

• PAOHVis: open-source PAOHVis system for visualizing dynamic hypergraphs.