# Hypergraph

In mathematics, a **hypergraph** is a generalization of a graph in which an edge can connect any number of vertices. Formally, a hypergraph is a pair where is a set of elements called *nodes* or *vertices*, and is a set of non-empty subsets of called **hyperedges** or **edges**. Therefore, is a subset of , where is the power set of .

While graph edges are pairs 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, it is a collection of sets of size *k*.) 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** *X*. The difference between a set system and a hypergraph is in the questions being asked. Hypergraph theory tends to concern questions similar to those of graph theory, such as connectivity and colorability, while the theory of set systems tends to ask non-graph-theoretical questions, such as those of Sperner theory.

There are variant definitions; sometimes edges must not be empty, and sometimes multiple edges, with the same set of nodes, are allowed.

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*.^{[1]}
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**.^{[2]}

Special kinds of hypergraphs include, besides *k*-uniform ones, 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.

## Contents

## Terminology

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 be the hypergraph consisting of vertices

and having *edge set*

where and are the index sets of the vertices and edges respectively.

A **subhypergraph** is a hypergraph with some vertices removed. Formally, the subhypergraph induced by a subset of is defined as

The **partial hypergraph** is a hypergraph with some edges removed. Given a subset of the edge index set, the partial hypergraph generated by is the hypergraph

Given a subset , the **section hypergraph** is the partial hypergraph

The **dual** of is a hypergraph whose vertices and edges are interchanged, so that the vertices are given by and whose edges are given by where

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.,

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.

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 _{1}*,

*e*) are connected with an edge if and only if vertex

_{1}*x*is contained in edge

_{1}*e*in

_{1}*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:^{[3]} 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 of vertices and some pair of hyperedges such that and , 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,^{[4]} 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^{[5]}^{[6]} (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.^{[7]} 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.^{[8]}

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^{[9]} 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^{[9]} to an earlier definition by Graham.^{[6]} 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.^{[9]}

## 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 is **isomorphic** to a hypergraph , written as if there exists a bijection

and a permutation of such that

The bijection is then called the isomorphism of the graphs. Note that

When the edges of a hypergraph are explicitly labeled, one has the additional notion of *strong isomorphism*. One says that is **strongly isomorphic** to if the permutation is the identity. One then writes . 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 is **equivalent** to , and writes if the isomorphism has

and

Note that

If, in addition, the permutation is the identity, one says that equals , and writes . Note that, with this definition of equality, graphs are self-dual:

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 with edges

and

Then clearly and are isomorphic (with , *etc.*), but they are not strongly isomorphic. So, for example, in , vertex meets edges 1, 4 and 6, so that,

In graph , there does not exist any vertex that meets edges 1, 4 and 6:

In this example, and are equivalent, , and the duals are strongly isomorphic: .

## Symmetric hypergraphs

The **rank** of a hypergraph 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

**. A graph is just a 2-uniform hypergraph.**

*k*-hypergraphThe 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 . Two edges and are said to be **symmetric** if there exists an automorphism such that .

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 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 and . Every hypergraph has an incidence matrix where

The transpose of the incidence matrix defines a hypergraph called the **dual** of , where is an *m*-element set and is an *n*-element set of subsets of . For and if and only if .

## Hypergraph coloring

Classic hypergraph coloring is assigning one of the colors from set 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. General criterion of 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^{[10]} states that, for an edge-transitive hypergraph , there exists a partition

of the vertex set such that the subhypergraph generated by is transitive for each , and such that

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^{[11]} and parallel computing.^{[12]}^{[13]}^{[14]}

## 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

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.^{[15]}^{[16]} 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.^{[17]}^{[18]}

In another style of hypergraph visualization, the subdivision model of hypergraph drawing,^{[19]} 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^{n} − 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,^{[20]} 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.^{[21]}

## 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, *ad infinitum*. In essence, every edge is just an internal node of a tree or directed acyclic graph, and vertexes 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 vertexes 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 and whose edges are and . Then, although and , it is not true that . 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 and , and zero vertices, so that and . 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

## See also

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

## Notes

- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ Judea Pearl, in
*HEURISTICS Intelligent Search Strategies for Computer Problem Solving*, Addison Wesley (1984), p. 25. - ↑ Claude Berge,
*Graphs and Hypergraphs* - ↑ C. Beeri, R. Fagin, D. Maier, M. Yannakakis,
*On the Desirability of Acyclic Database Schemes* - ↑ C. T. Yu and M. Z. Özsoyoğlu.
*An algorithm for tree-query membership of a distributed query*. In Proc. IEEE COMPSAC, pages 306-312, 1979 - ↑
^{6.0}^{6.1}M. H. Graham.*On the universal relation*. Technical Report, University of Toronto, Toronto, Ontario, Canada, 1979 - ↑ S. Abiteboul, R. B. Hull, V. Vianu,
*Foundations of Databases* - ↑ R. E. Tarjan, M. Yannakakis.
*Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs*. SIAM J. on Computing, 13(3):566-579, 1984. - ↑
^{9.0}^{9.1}^{9.2}Ronald Fagin,*Degrees of Acyclicity for Hypergraphs and Relational Database Schemes* - ↑ E. Dauber, in
*Graph theory*, ed. F. Harary, Addison Wesley, (1969) p. 172. - ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=conference }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}.

## 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 - {{#invoke:citation/CS1|citation

|CitationClass=citation }}

- 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.
*This article incorporates material from hypergraph on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.*