说明for introduction to matchings介绍匹配.pptx
IntroductiontoMatchings
BipartiteGraphsAbipartitegraphisagraphwherethenodesareintwodistinctsetsEveryedgeconnectsamemberofthefirstsettoamemberofthesecondsetABipartitegraphNotaBipartitegraph
CompleteBipartiteGraphsABipartitegraphiscompleteifeverynodeinonesetisconnectedtoeverynodeoftheothersetItisdescribedas wheremisthenumberofverticesinoneset,andnthenumberintheother
MatchingsAmatchingisasubsetoftheedgesofabipartitegraphsuchthatnonodehasmorethanoneedgeinthematchingThisisaMATCHINGThisisnotaMatching
MaximalMatchingsAmatchingismaximalifitisnotpossibletoaddmoreedgesNotmaximalMaximal
CompleteMatchingsAmatchingiscompleteif:thetwosetshavethesamenumberofverticesthematchingincludeseveryvertexThisisacompletematchingNotethatthematchingcanbecompleteevenifthebipartitegraphisnot
TheEnd