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 in a graph.[1]: 466–470 [2]
^Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549
^Berge, Claude (1973). Graphs and Hypergraphs. Amsterdam: North-Holland.
and 21 Related for: Matching in hypergraphs information
3-dimensional matching – a special case of hypergraphmatching to 3-uniform hypergraphs. Vertex cover inhypergraphs Bipartite hypergraph Rainbow matchingin hypergraphs...
problem of finding a maximum-cardinality matchinginhypergraphs is NP-complete even for 3-uniform hypergraphs. West, Douglas Brent (1999), Introduction...
fractional matchings. In contrast, the case of rainbow integral matchingsin r-uniform hypergraphs is much less understood. The number of required matchings for...
corresponding hypergraphs. As a special case of this correspondence between bipartite graphs and hypergraphs, any multigraph (a graph in which there may...
maximum matching. The Kőnig-Egervary theorem says that all bipartite graphs have the Konig property. The balanced hypergraphs are exactly the hypergraphs H...
optimization. Matchinginhypergraphs – discusses also the duality between vertex-cover and matching. Lovász, László; Plummer, M. D. (1986), Matching Theory...
In graph theory, the term bipartite hypergraph describes several related classes of hypergraphs, all of which are natural generalizations of a bipartite...
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...
hypergraphs". Ars Combinatorica. Abu-Khazneh, Ahmad; Barát, János; Pokrovskiy, Alexey; Szabó, Tibor (2018-07-12). "A family of extremal hypergraphs for...
flag complexes, Whitney complexes and conformal hypergraphs are closely related mathematical objects in graph theory and geometric topology that each describe...
algorithm Strongly connected component Vertex cover problem See list of network theory topics Helly family Intersection (Line) Graphs of hypergraphs...
all H: w(H) ≥ mw(H). The width of a hypergraph is used in Hall-type theorems for hypergraphs. Let H be the hypergraph with vertex set V = {A,B; a,b} and...
into a space with Helly dimension 1. A hypergraph is equivalent to a set-family. Inhypergraphs terms, a hypergraph H = (V, E) has the Helly property if...
regular graphs was done by Spielman (1996). For hypergraphs of bounded rank, a subexponential upper bound matching the case of graphs was obtained by Babai &...
program is the maximum matching problem. Vertex cover problems have been generalized to hypergraphs, see Vertex cover inhypergraphs. Formally, a vertex...
of edges in each subset share any vertex. There are two famous algorithms to achieve asymptotically optimal packing in k-uniform hypergraphs. One of them...
Global Information