We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 05 November 2011
This chapter is devoted to bipartite graphs which have the property that any subset of vertices, from one of the colour classes, has a neighbour set which is at least as large as itself, be it by some additive or multiplicative factor. We shall see that such graphs have a very useful structure, and a variety of applications.
Graphs with Hall's condition
We begin by considering bipartite graphs with bipartition (V1, V2) which satisfy the condition |N(A)| ≥ |A| for every A ⊆ V1 (where N(∅) = ∅). Graphs with this property arise very often in practice. Many practical problems can be reformulated as problems about finding a matching M such that every vertex in V1 is incident with an edge in M. Such a matching is called a matching of V1 into V2. The ‘marriage problem’, which we have already considered in Section 5.1, is one of many examples.
It is clear that for us to hope to find a matching of V1 into V2 we must have |N(A)| ≥ |A| for every A ⊆ V1. Remarkably, as the following result of Philip Hall (1935) shows, this condition is also sufficient.
Theorem 6.1.1 (Hall's Theorem) Let G be a bipartite graph with bipartition (V1, V2). Then G has a matching of V1 into V2 if and only if |N(A) ≥ |A| for every A ⊆ V1.
To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.
