Editing Edge coloring (section)

==Relation to matching==
[[File:Class-2-planar-3-regular.svg|thumb|This 3-regular [[planar graph]] has 16 vertices and 24 edges, but only 7 edges in any maximum matching. Therefore, it requires four colors in any edge coloring.]]
A [[Matching (graph theory)|matching]] in a graph {{mvar|G}} is a set of edges, no two of which are adjacent; a [[perfect matching]] is a matching that includes edges touching all of the vertices of the graph, and a [[maximum matching]] is a matching that includes as many edges as possible. In an edge coloring, the set of edges with any one color must all be non-adjacent to each other, so they form a matching. That is, a proper edge coloring is the same thing as a partition of the graph into disjoint matchings.

If the size of a maximum matching in a given graph is small, then many matchings will be needed in order to cover all of the edges of the graph. Expressed more formally, this reasoning implies that if a graph has {{mvar|m}} edges in total, and if at most {{math|&beta;}} edges may belong to a maximum matching, then every edge coloring of the graph must use at least {{math|''m''/&beta;}} different colors.<ref name="s134">{{harvtxt|Soifer|2008}}, p. 134.</ref> For instance, the 16-vertex planar graph shown in the illustration has {{math|1=''m'' = 24}} edges. In this graph, there can be no perfect matching; for, if the center vertex is matched, the remaining unmatched vertices may be grouped into three different connected components with four, five, and five vertices, and the components with an odd number of vertices cannot be perfectly matched. However, the graph has maximum matchings with seven edges, so {{math|1=&beta; = 7}}. Therefore, the number of colors needed to edge-color the graph is at least 24/7, and since the number of colors must be an integer it is at least four.

For a [[regular graph]] of degree {{mvar|k}} that does not have a perfect matching, this lower bound can be used to show that at least {{math|''k'' + 1}} colors are needed.<ref name="s134"/> In particular, this is true for a regular graph with an odd number of vertices (such as the odd complete graphs); for such graphs, by the [[handshaking lemma]], {{mvar|k}} must itself be even. However, the inequality {{math|χ&prime; ≥ ''m''/&beta;}} does not fully explain the chromatic index of every regular graph, because there are regular graphs that do have perfect matchings but that are not ''k''-edge-colorable. For instance, the [[Petersen graph]] is regular, with {{math|1=''m'' = 15}} and with {{math|1=&beta; = 5}} edges in its perfect matchings, but it does not have a 3-edge-coloring.