About matching

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.

members

here now

Everything about matching →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

matching

set of edges without common vertices

0members1here now

Ask Genius Site

Site Journal

Not who you're looking for? Others named matching: village and civil parish in Essex, England, UK · statistics method

Feed Discussions About

Comments

Ask Genius by OpenServe:

Free account · your comment posts right after signup

About matching

members

here now

Everything about matching →

Live room · 1 here

Be the first in the room — members see you arrive.

Join the room

Facts from Wikidata (CC0).

Not who you're looking for? Others named matching: village and civil parish in Essex, England, UK · statistics method