PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (198)
Orphanage
Unclass'd
Unproven (490)
Corrections (7)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: High Entry average rating: No information on entry rating
saturate (Definition)

Let $ G(V,E)$ be a graph and $ M$ a matching in $ G$. A vertex $ v\in V(G)$ is said to be saturated by $ M$ if there is an edge in $ M$ incident to $ v$. A vertex $ v\in V(G)$ with no such edge is said to be unsaturated by $ M$. We also say that $ M$ saturates $ v$.



"saturate" is owned by mathcam.
(view preamble)

View style:

See Also: Hall's marriage theorem, bipartite matching, matching

Other names:  saturates, saturated
Log in to rate this entry.
(view current ratings)

Cross-references: incident, edge, vertex, matching, graph
There are 3 references to this entry.

This is version 1 of saturate, born on 2003-09-18.
Object id is 4735, canonical name is Saturate.
Accessed 4927 times total.

Classification:
AMS MSC: 05D15 (Combinatorics :: Extremal combinatorics :: Transversal theory)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)