Independent edges

Independent edges --- независимые ребра.

Given a graph (digraph, hypergraph) [math]\displaystyle{ G }[/math], edges such that no two have an endpoint in common are called independent.

Another name is Matching.