graphs – What is a fractional match?

For the maximum matching problem, we can find the fractional matching that I understand involves some sort of weighting for the edges. However, I do not manage to find a simple and accurate explanation of what is a fractional approximation. How does it compare to full correspondence?

If this question seems too basic, could I have a link to a place that explains it?