Home > Hypergraph

Informally a hypergraph is a graph whose edges, instead of each connecting just two vertices, connect more than two vertices. For any set X, let X^[m] be the set of subsets of X whose elements have precisely m members (these are the m-sets or m-subsets of X, and can be counted by a binomial coefficient in case X is finite). Then an m-hypergraph consists of a set X of vertices and a subset E of X^[m]. A hypergraph is then defined to be a pair of sets (X,E) such that the pair constitute an m-hypergraph for some m. Commonly X is finite but this need not always be the case.

It is also possible to define a hypergraph in a more general way as a pair of sets (X,E) where E is some arbitrary subset of the power set of X. In this case the number of the vertices in each edge is not constant from one edge to the next. This definition is less commonly encountered, but in such contexts the term uniform is used to mean a hypergraph whose edges have an equal number of elements. A synonym for hypergraph in this sense is set system, or family of sets, drawn from X as universal set.

Many theorems involving graphs also hold for hypergraphs. See Ramsey's theorem for a typical example. Some methods of studying the symmetries of graphs extend to hypergraphs too. For instance, a hypergraph homomorphism is a map from the vertex set of one hypergraph to another such that one edge is mapped to another edge. An hypergraph isomorphism is a homomorphism that is invertible. A hypergraph automorphism is an isomorphism from a vertex set into itself. The set of automorphisms of a hypergraph H (=(X,E)) is a group under composition. This group is called the automorphism group of the hypergraph, written Aut(H). The collection of hypergraphs is clearly a category with hypergraph homomorphisms as morphisms.

A property of graphs that encourages their study, is that it is easy to draw a representation of them on a piece of paper. This is not so for hypergraphs and so their study tends to be conducted using the nomenclature of set theory rather than the more pictoral descriptions (for instance 'trees','forests' and 'cycles') of graph theory.

A transversal or hitting set of the hypergraph H=(X,E) is a set T⊂X that has nonempty intersection with all the edges in E. The transversal hypergraph of H is the hypergraph (X,F) whose edge set F consists of all transversals of H. Computing the transversal hypergraph has applications in machine learning and other fields of computer scienceIn its most general sense, computer science CS or compsci is the study of computation and information processing, both in hardware and in software. Introduction Computer science encomposses a variety of topics relating to computation, ranging from abstrac.

See also:

• Erdös-Ko-Rado theoremIn combinatorial mathematics, the Erdos-Ko-Rado theorem of Paul Erdos, Chao Ko and Richard Rado, states that if : > 2, and is a family of subsets of of size , each pair of which intersects, then the maximum number of sets that can be in is given by the bi
• Almost disjoint setsIn mathematics, two sets are almost disjoint if their intersection is small in some sense. Different definitions of "small" will therefore result in different definitions of "almost disjoint". Definition The most common choice is to take "small" to mean f
• Disjoint setsIn mathematics, two sets are said to be disjoint if they have no element in common. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets. Formally, two sets A and B are disjoint if their intersection is empty, i. if : This definition extends to any coll
• Partition of a setA partition of U into 6 blocks: a Venn diagram representation. In mathematics, a partition of a set X is a division of X into non-overlapping parts or blocks that cover all of X''. Definition A partition of a set X is a set of nonempty subsets of X such t
• Finite intersection propertyIn topology, the finite intersection property is a property of a collection of subsets of a set X. A collection has this property if the intersection over any finite subcollection of the collection is nonempty. This is trivially satisfied if the intersect
• Abstract simplicial complexIn mathematics, given a universal set , and , a family of sets over , is an abstract simplicial complex if the following is true: :for each , if then for each subset it follows that. The elements of are called abstract simplices . See also: simplicial com
• Incidence structureIn mathematics, in particular in combinatorics, an incidence structure is a triple : where is the set of "points", is the set of "lines" and is the incidence relation. The elements of are called flags. If we say that "point" lies on "line". Each hypergrap