- 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...
- In
graph theory, a
matching in a
hypergraph is a set of hyperedges, in
which every two
hyperedges are disjoint. It is an
extension of the
notion of matching...
- theory, a
balanced hypergraph is a
hypergraph that has
several properties analogous to that of a
bipartite graph.
Balanced hypergraphs were
introduced by...
- In
graph theory, a
vertex cover in a
hypergraph is a set of vertices, such that
every hyperedge of the
hypergraph contains at
least one
vertex of that...
- In
graph theory,
particularly in the
theory of
hypergraphs, the line
graph of a
hypergraph H,
denoted L(H), is the
graph whose vertex set is the set of...
-
Altair Engineering Inc. is an
American multinational information technology company headquartered in Troy, Michigan. It
provides software and
cloud solutions...
- theory,
there are two
related properties of a
hypergraph that are
called its "width".
Given a
hypergraph H = (V, E), we say that a set K of
edges pins...
- In
graph theory, the
hypergraph removal lemma states that when a
hypergraph contains few
copies of a
given sub-
hypergraph, then all of the
copies can be...
- In the
mathematical theory of
hypergraphs, a
hedgehog is a 3-uniform
hypergraph defined from an
integer parameter t {\displaystyle t} . It has t + ( t...
- is an
algorithm that
applies to
hypergraphs. The
algorithm takes as
input a
hypergraph and
determines if the
hypergraph is α-acyclic. If so, it computes...
