OurBigBook
About
$
Donate
Sign in
Sign up
Matching number
(
ν
(
G
)
)
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Matching in a graph
Created
2026-09-24
Updated
2026-10-03
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The
matching number
ν
(
G
)
is the largest
number
of edges in
a
matching of
G
.
Ancestors
(6)
Matching in a graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Synonyms
(1)
codex/maximum-matching-number
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version