In graph theory, a fractional matching is a generalization of a matching in which, intuitively, each vertex may be broken into fractions that are matched to different neighbor vertices. Given a graph G = (V, E), a fractional matching in G is a function that assigns, to each edge e in E, a fraction f(e) in [0, 1], such that for every vertex v in V, the sum of fractions of edges adjacent to v is at most 1: A matching in the traditional sense is a special case of a fractional matching, in which the fraction of every edge is either 0 or 1: f(e) = 1 if e is in the matching, and f(e) = 0 if it is not.
In computer science and graph theory, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized. A special case of it is the assignment problem, in which the input is restricted to be a bipartite graph, and the matching constrained to be have cardinality that of the smaller of the two partitions. Another special case is the problem of finding a maximum cardinality matching on an unweighted graph: this corresponds to the case where all edge weights are the same.
Marriage, also called matrimony or wedlock, is a culturally and often legally recognized union between people called spouses. It establishes rights and obligations between them, as well as between them and their children (if any), and between them and their in-laws. It is nearly a cultural universal, but the definition of marriage varies between cultures and religions, and over time. Typically, it is an institution in which interpersonal relationships, usually sexual, are acknowledged or sanctioned.
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In other words, a subset of the edges is a matching if each vertex appears in at most one edge of that matching. Finding a matching in a bipartite graph can be treated as a network flow problem. Given a graph G = (V, E), a matching M in G is a set of pairwise non-adjacent edges, none of which are loops; that is, no two edges share common vertices.
A civil marriage is a marriage performed, recorded, and recognized by a government official. Such a marriage may be performed by a religious body and recognized by the state, or it may be entirely secular. Every country maintaining a population registry of its residents keeps track of marital status, and all UN Member countries except Iran, Somalia, South Sudan, Sudan, and Tonga have signed or ratified either the United Nations Convention on Consent to Marriage, Minimum Age for Marriage, and Registration of Marriages (1962) or the United Nations Convention on the Elimination of All Forms of Discrimination against Women (1979) which carry a responsibility to register marriages.