Perfect matching in high-degree hypergraphs

In graph theory, perfect matching in high-degree hypergraphs is a research avenue trying to find sufficient conditions for existence of a perfect matching in a hypergraph, based only on the degree of vertices or subsets of them. == Introduction == === Degrees and matchings in graphs === In a simple graph G = (V, E), the degree of a vertex v, often denoted by deg(v) or δ(v), is the number of edges in E adjacent to v.

Source: Wikipedia — Perfect matching in high-degree hypergraphs (CC BY-SA 4.0)