3-dimensional matching – a special case of hypergraph matching to 3-uniform hypergraphs. Vertex cover in hypergraphs Bipartite hypergraph Rainbow matching in hypergraphs...

2-dimensional matching) to 3-partite hypergraphs, which consist of hyperedges each of which contains 3 vertices (instead of edges containing 2 vertices in a usual...

fractional matchings. In contrast, the case of rainbow integral matchings in r-uniform hypergraphs is much less understood. The number of required matchings for...

optimization. Matching in hypergraphs – discusses also the duality between vertex-cover and matching. Lovász, László; Plummer, M. D. (1986), Matching Theory...

In graph theory, perfect matching in high-degree hypergraphs is a research avenue trying to find sufficient conditions for existence of a perfect matching...

involves bipartite matching as sub-problem. Subtree isomorphism problem involves bipartite matching as sub-problem. Matching in hypergraphs - a generalization...

hypergraphs, in particular: Matching in hypergraphs; Vertex cover in hypergraphs (also known as: transversal); Line graph of a hypergraph; Hypergraph...

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

problem of finding a maximum-cardinality matching in hypergraphs is NP-complete even for 3-uniform hypergraphs. West, Douglas Brent (1999), Introduction...

conjecture relating the maximum matching size and the minimum transversal size in hypergraphs. This conjecture first appeared in 1971 in the Ph.D. thesis of J....

hypergraphs". Discrete Mathematics. 84 (3): 309–313. doi:10.1016/0012-365X(90)90136-6. ISSN 0012-365X. Kessler, Ofra (1989). Matchings in Hypergraphs...

Maximum-cardinality matching Perfect matching in high-degree hypergraphs Hall-type theorems for hypergraphs The unique perfect matching problem Alan Gibbons...

Füredi, Zoltán (1981-06-01). "Maximum degree and fractional matchings in uniform hypergraphs". Combinatorica. 1 (2): 155–162. doi:10.1007/BF02579271. ISSN 1439-6912...

maximum matching. The Kőnig-Egervary theorem says that all bipartite graphs have the Konig property. The balanced hypergraphs are exactly the hypergraphs H...

into a space with Helly dimension 1. A hypergraph is equivalent to a set-family. In hypergraphs terms, a hypergraph H = (V, E) has the Helly property if...

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

corresponding hypergraphs. As a special case of this correspondence between bipartite graphs and hypergraphs, any multigraph (a graph in which there may...

In graph theory, the term bipartite hypergraph describes several related classes of hypergraphs, all of which are natural generalizations of a bipartite...

program is the maximum matching problem. Vertex cover problems have been generalized to hypergraphs, see Vertex cover in hypergraphs. Formally, a vertex...

on perfect matchings. A generalization of Hall's theorem to bipartite hypergraphs is provided by various Hall-type theorems for hypergraphs. Hall 1986...

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

flag complexes, Whitney complexes and conformal hypergraphs are closely related mathematical objects in graph theory and geometric topology that each describe...

Classification Structures in Oceania, Cambridge University Press, p. 48, ISBN 978-0-521-55232-5 Berge, Claude (1976), Graphs and Hypergraphs, North-Holland Mathematical...

algorithm Strongly connected component Vertex cover problem See list of network theory topics Helly family Intersection (Line) Graphs of hypergraphs...

one in line #1 and one in line #2. The following two concepts are defined for d-interval hypergraphs just like for finite hypergraphs: A matching is a...

thousands and even billions of nodes in some cases (e.g. Facebook or LinkedIn). 1-planarity 3-dimensional matching: SP1  Bandwidth problem: GT40  Bipartite...

sets in G are the matchings in H. Hence, a rainbow-independent set in G is a rainbow matching in H. See also matching in hypergraphs. Another related concept...

Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Beck, J. (1978), "On 3-chromatic hypergraphs"...

Discrepancy of hypergraphs is an area of discrepancy theory that studies the discrepancy of general set systems. In the classical setting, we aim at partitioning...

In graph theory, Berge's theorem states that a matching M in a graph G is maximum (contains the largest possible number of edges) if and only if there...