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.
Definition
Given a graphG =, a fractional matching in G is a function that assigns, to each edge e in E, a fraction f in , 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 = 1 if e is in the matching, and f = 0 if it is not. For this reason, in the context of fractional matchings, usual matchings are sometimes called integral matchings. The size of an integral matching is the number of edges in the matching, and the matching number of a graph G is the largest size of a matching in G. Analogously, the size of a fractional matching is the sum of fractions of all edges. The fractional matching number of a graph G is the largest size of a fractional matching in G. It is often denoted by. Since a matching is a special case of a fractional matching, for every graph G one has that the integral matching number of G is less than or equal to the fractional matching number of G; in symbols:A graph in which is called a stable graph. Every bipartite graph is stable; this means that in every bipartite graph, the fractional matching number is an integer and it equals the integral matching number. In a general graph, The fractional matching number is either an integer or a half-integer.
For a bipartite graph G =, a fractional matching can be presented as a matrix with |X| rows and |Y| columns. The value of the entry in row x and column y is the weight on the edge.
Perfect fractional matching
A fractional matching is called perfect if the sum of weights adjacent to each vertex is exactly 1. The size of a perfect matching is exactly |V|/2. In a bipartite graph G =, a fractional matching is called X-perfect if the sum of weights adjacent to each vertex of X is exactly 1. The size of an X-perfect fractional matching is exactly |X|. For a bipartite graph G =, the following are equivalent:
The first condition implies the second because an integral matching is a fractional matching. The second implies the third because, for each subset W of X, the sum of weights near vertices of W is |W|, so the edges adjacent to them are necessarily adjacent to at least |W| vertices of Y. By Hall's marriage theorem, the last condition implies the first one.
A largest fractional matching in a graph can be easily found by linear programming, or alternatively by a maximum flow algorithm. In a bipartite graph, it is possible to convert a maximum fractional matching to a maximum integral matching of the same size. This leads to a simple polynomial-time algorithm for finding a maximum matching in a bipartite graph. If G is a bipartite graph with |X| = |Y| = n, and M is a perfect fractional matching, then the matrix representaion of M is a doubly stochastic matrix - the sum of elements in each row and each column is 1. Birkhoff's algorithm can be used to decompose the matrix into a convex sum of at most n2-2n+2 permutation matrices. This corresponds to decomposing M into a convex sum of at most n2-2n+2 perfect matchings.
Given a graph G =, the fractional matching polytope of G is a convex polytope that represents all possible fractional matchings of G. It is a polytope in R|E| - the |E|-dimensional Euclidean space. Each point in the polytope represents a matching in which the weight of each edge e is xe. The polytope is defined by |E| non-negativity constraints and |V| vertex constraints.
