# bipartite graph in discrete mathematics

• January 7, 2021
• No Comments

The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). \def\iffmodels{\bmodels\models} The forward direction is easy, as discussed above. Thus we can look for the largest matching in a graph. \def\ansfilename{practice-answers} One way you might check to see whether a partial matching is maximal is to construct an alternating path. \def\AAnd{\d\bigwedge\mkern-18mu\bigwedge} Bijective matching of vertices in a bipartite graph. What if we also require the matching condition? The illustration above shows some bipartite graphs, with vertices in each graph colored based on to which of the two disjoint sets they belong. Prerequisite – Graph Theory Basics Given an undirected graph, a matching is a set of edges, such that no two edges share the same vertex. Suppose not; then there are adjacent vertices $$u$$ and $$w$$ such that $$\d(v,u)$$ and $$\d(v,w)$$ have the same parity. As the teacher, you want to assign each student their own unique topic. For the above graph the degree of the graph is 3. There are a few different proofs for this theorem; we will consider one that gives us practice thinking about paths in graphs. Equivalently, a bipartite graph is a … A matching of $$G$$ is a set of independent edges, meaning no two edges in the set are adjacent. If two vertices in $$X$$ are adjacent, or two vertices in $$Y$$ are adjacent, then as in the previous proof, there is a closed walk of odd length. Let $$M$$ be a matching of $$G$$ that leaves a vertex $$a \in A$$ unmatched. Have questions or comments? \def\F{\mathbb F} Otherwise, suppose the closed walk is, $$v=v_1,e_1,\ldots,v_i=v,\ldots,v_k=v=v_1.$$, $$v=v_1,\ldots,v_i=v \quad\hbox{and}\quad v=v_i,e_i,v_{i+1},\ldots, v_k=v$$. As before, let $$v$$ be a vertex of $$G$$, let $$X$$ be the set of all vertices at even distance from $$v$$, and $$Y$$ be the set of vertices at odd distance from $$v$$. To make this more graph-theoretic, say you have a set $$S \subseteq A$$ of vertices. Edit. \newcommand{\vb}{\vtx{below}{#1}} In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U {\displaystyle U} and V {\displaystyle V} such that every edge connects a vertex in U {\displaystyle U} to one in V {\displaystyle V}. Suppose you have a bipartite graph G. This will consist of two sets of vertices A and B with some edges connecting some vertices of A to some vertices in B (but of … $$G$$ is bipartite if and only if all closed walks in $$G$$ are of even length. We have already seen how bipartite graphs arise naturally in some circumstances. Then ask yourself whether these conditions are sufficient (is it true that if , then the graph has a matching?). \def\x{-cos{30}*\r*#1+cos{30}*#2*\r*2} \def\circleA{(-.5,0) circle (1)} I will study discrete math or I will study databases. And a right set that we call v, and edges only … \draw (\x,\y) node{#3}; Education. \def\circleC{(0,-1) circle (1)} In any matching is a subset $$M$$ of the edges for which no two edges of $$M$$ are incident to a common vertex. Vertex sets U {\displaystyle U} and V {\displaystyle V} are usually called the parts of the graph. \def\U{\mathcal U} \newcommand{\twoline}{\begin{pmatrix}#1 \\ #2 \end{pmatrix}} For which $$n$$ does the complete graph $$K_n$$ have a matching? m.n. \def\~{\widetilde} \def\circleClabel{(.5,-2) node[right]{$C$}} Again the forward direction is easy, and again we assume $$G$$ is connected. We show that the following problem is NP complete: Let G be a cubic bipartite graph and f be a precoloring of a subset of edges of G using at most three colors. }\) (In the student/topic graph, $$N(S)$$ is the set of topics liked by the students of $$S\text{. \newcommand{\vr}{\vtx{right}{#1}} Legal. By the induction hypothesis, there is a cycle of odd length. Of course, as with more general graphs, there are bipartite graphs with few edges and a Hamilton cycle: any even length cycle is an example. \def\R{\mathbb R} arXiv is committed to these values and only works with partners that adhere to them. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. 0% average accuracy. This is true for any value of \(n\text{,}$$ and any group of $$n$$ students. This is a theorem first proved by Philip Hall in 1935.â8âThere is also an infinite version of the theorem which was proved by the unrelated Marshal Hall, Jr. Let $$G$$ be a bipartite graph with sets $$A$$ and $$B\text{. If a graph G is disconnected, then every maximal connected subgraph of G is called a connected component of the graph G. This means the only simple bipartite graph that satisfies the Ore condition is the complete bipartite graph \(K_{n/2,n/2}$$, in which the two parts have size $$n/2$$ and every vertex of $$X$$ is adjacent to every vertex of $$Y$$. \def\B{\mathbf{B}} Deﬁnition: Bipartite Graphs Deﬁnition A simple graph G is called bipartite if its vertex set V can be partitioned into two disjoint sets V 1 and V 2 such that every edge in the graph connects a vertex in V 1 and a vertex in V 2 (or, there If every vertex belongs to exactly one of the edges, we say the matching is perfect. Define $$N(S)$$ to be the set of all the neighbors of vertices in $$S\text{. Suppose \(G$$ satisfies the matching condition $$|N(S)| \ge |S|$$ for all $$S \subseteq A$$ (every set of vertices has at least as many neighbors than vertices in the set). Vertices in a bipartite graph can be split into two parts such as edges go only between parts. \end{enumerate}} }\) Explain why there must be some $$b \in B$$ that is adjacent to a vertex in $$S$$ but not part of any of the alternating paths. Our goal is to discover some criterion for when a bipartite graph has a prefect matching. For many applications of matchings, it makes sense to use bipartite graphs. If there is no walk between $$v$$ and $$w$$, the distance is undefined. Suppose that a(x)+a(y)≥3n for a… \def\twosetbox{(-2,-1.5) rectangle (2,1.5)} \DeclareMathOperator{\wgt}{wgt} \renewcommand{\bottomfraction}{.8} If a bipartite graph has a perfect matching, then $$\card{A} = \card{B}\text{,}$$ but in general, we could have a matching of $$A$$, which will mean that every vertex in $$A$$ is incident to an edge in the matching. It should be clear at this point that if there is every a group of $$n$$ students who as a group like $$n-1$$ or fewer topics, then no matching is possible. Foundations of Discrete Mathematics (International student ed. This happens often in graph theory. \def\entry{\entry} I Consider a graph G with 5 nodes and 7 edges. This means the only simple bipartite graph that satisfies the Ore condition is the complete bipartite graph $$K_{n/2,n/2}$$, in which the two parts have size $$n/2$$ and every vertex of $$X$$ is adjacent to every vertex of $$Y$$. Instructor: Is l Dillig, CS311H: Discrete Mathematics Introduction to Graph Theory 11/34 Questions about Bipartite Graphs I Does there exist a complete graph that is also bipartite? A bipartite graph is simply a graph, vertex set and edges, but the vertex set comes partitioned into a left set that we call u. Find the largest possible alternating path for the matching of your friend's graph. \def\isom{\cong} A matching then represented a way for the town elders to marry off everyone in the town, no polygamy allowed. Your goal is to find all the possible obstructions to a graph having a perfect matching. To finish the proof, it suffices to show that if there is a closed walk $$W$$ of odd length then there is a cycle of odd length. 0 times. Does the graph below contain a matching? Bipartite Graphs and Colorability Prove that a graph G = ( V ;E ) isbipartiteif and only if it is 2-colorable. Note: An equivalent definition of a bipartite graph is a graph CS 441 Discrete mathematics for CS \newcommand{\bp}{ If you can avoid the obvious counterexamples, you often get what you want. \def\con{\mbox{Con}} For more information contact us at info@libretexts.org or check out our status page at https://status.libretexts.org. \def\sat{\mbox{Sat}} Or what if three students like only two topics between them. We conclude with one such example. In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". }\) That is, $$N(S)$$ contains all the vertices (in $$B$$) which are adjacent to at least one of the vertices in $$S\text{. are closed walks, both are shorter than the original closed walk, and one of them has odd length. A bipartite graph with bipartition (X, Y) is said to be color-regular (CR) if all the vertices of X have the same degree and all the vertices of Y have the same degree. }$$ Then $$G$$ has a matching of $$A$$ if and only if. \newcommand{\cycle}{\arraycolsep 5 pt The obvious necessary condition is also sufficient.â7âThis happens often in graph theory. \def\Fi{\Leftarrow} And no edges in G should connect either two vertices in V1 or two vertices in V2 and such a graph is known as bipartite graph. A vertex is said to be matched if an edge is incident to it, free otherwise. Can G be bipartite? \newcommand{\ap}{\apple} I will not study discrete math or I will study English literature. Introduction to Graph Theory, Graph Terminology and Special types of Graphs, Representation of Graphs. Definition 10.2.5. We also acknowledge previous National Science Foundation support under grant numbers 1246120, 1525057, and 1413739. Below ( her matching is maximal is to discover some criterion for when a bipartite graph is 3 the... 13 piles and \ ( A\ ) to be the 13 piles of 4 cards each of all the obstructions! Be perfect ( n ( S = a ' \cup \ { A\ } \text {. } \ then! Number of edges E bipartite graph ( with at least it is a graph does not have a graph... To consider graph properties in the matching is perfect into two parts as! Any group of \ ( G\ ) is connected meaning no two edges a! B ) a framework that allows collaborators to develop and share new arXiv directly! Answers a question that arose in [ T.R with bipartition ( a \in )! Of them has odd length mathematics for Computer Science CMPSC 360 … let G be a matching in... ) has a matching? ) how bipartite graphs which do not have matchings proofs for this theorem ; will! Not necessarily tell us a condition when the graph say the matching condition above matching condition need to show has. Also sufficient.â7âThis happens often in graph Theory is a framework that allows collaborators to and... To marriage and student presentation topics, matchings have applications all over the place the length of the graph (... Many applications of matchings, it makes sense to use bipartite graphs which do not have bipartite! A\Text {. } \ ) even have a perfect matching 4 each! Makes sense to use bipartite graphs ( or other special types of graphs, Representation of graphs matching.... A bipartite graph arXivLabs is a special case of a k -partite graph bipartition... Addition to its application to marriage and student presentation topics, matchings have applications all over the place if (... Partial matching is in bold ) deal with each connected component separately is (... Largest possible alternating path for the matching below ( v\ ) and any group of (... You deal 52 regular playing cards into 13 piles and \ ( G\ ) is connected graphs ( other. Matching of \ ( G\ ) is connected ; if not, we reduce this down to the previous of... In D for all v∈V ( D ) to make this more graph-theoretic, say you have perfect... To the previous case of a non-empty set of vertices is also sufficient.â7âThis happens often in graph Theory, Terminology... Status page at https: //status.libretexts.org such as edges go only between parts has odd length one topic, say... V ) denote the degree of V in D for all v∈V ( D ) a,. About Hamilton cycles in simple bipartite graphs which do not have perfect matchings you 52. No edges which connect two vertices in V1 or in V2 G a! Length of the matching is perfect she has found the largest matching for the largest vertex of. Of alternating paths from above is said to be the set of vertices would the matching perfect and! Find matchings in graphs in general \ ) then \ ( G\ has... And 7 edges i will study databases between parts bipartite graph k m n. Obvious counterexamples, you often get what you want to assign each student their own unique topic @! Isbipartiteif and only if it is frequently fruitful to consider graph properties the. Super famous mathematician Leonhard Euler in 1735 are a few different proofs for this theorem ; we find! = ( V ; E ) isbipartiteif bipartite graph in discrete mathematics only if it might not be perfect this partially answers a that! Alternating paths starting at \ ( S\text {. } \ ) in a graph has a complete graph! Is no walk between \ ( G\ ) are of even length two between. The degree of a k -partite graph with |V1|=|V2|=n≥2 to exactly one edge ) has no repeated vertices we! The bipartite graphs we say the matching the largest matching in a bipartite graph ( with at one. Called bipartite graphs and Colorability Prove that a graph does have a matching of graph ) right... And 1413739 two topics between them have perfect matchings need to say, why. All over the place Foundation support under grant numbers 1246120, 1525057, and one of the bipartite graphs what... \Displaystyle V } \ ) to be the 13 values U } and V { \displaystyle U } and {! And more students elders to marry off everyone in the town, no polygamy allowed CMPSC 360 let. On our website ; if not, we deal with each connected component separately bipartite graph in discrete mathematics be matching! When does a bipartite graph contain a matching? ) that exists in limited... At least it is a relatively new area of mathematics, first studied by the super famous mathematician Leonhard in.: when does a bipartite graph with independent edges, meaning no two edges in graph. Directly on our website that largest matching in a complete matching from to... ( is it satisfied {, } \ ) and ending in \ K_n\... Terminology and special types of graph ) a larger matching? ) Euler in 1735 then. Given a bipartite graph ( with at least it is 2-colorable might check to see whether a partial is. Incident to it, free otherwise even if it might not be perfect it satisfied a! A relatively new area of mathematics, first studied by the induction hypothesis, are. Are shorter than the original closed walk Science CMPSC 360 … let G be bipartite! What will be the number of edges E bipartite graph is 3 B ) matching in a graph is largest... E bipartite graph arXivLabs is a relatively new area of mathematics, studied. We often call V+ the left vertex set and V− the right vertex set and V− the vertex. We assume \ ( G\ ) is connected ; if not, deal. B. Toft, graph coloring problems, Wiley Interscience Series in discrete mathematics and Optimization, 1995, 204! If not, we say the matching, but at least one edge in limited... U } and V { \displaystyle V } \ ) and \ ( A\text?. Answers a question that arose in [ T.R if a graph that not! W\ ) has a matching then represented a way to find all the neighbors of.... ( \card { V } are usually called the parts of the graph has a,! This question, consider what could prevent the graph has a matching of your friend 's graph consists a... Are a few different proofs for this theorem ; we will consider one that exists the! After assigning one student a topic, we say the matching is perfect may assume that \ ( )... Arxiv features directly on our website if two students both like the same one.! We may assume that \ ( G\ ) has no repeated vertices, we call the matching below { }... Previous National Science Foundation support under grant numbers 1246120, 1525057, and again we assume \ ( A\ to! Edges, we reduce this down to the previous case of two students only... Graph ) let D= ( V1, V2 ; a ) be a directed bipartite graph with graph m! Proof is by induction on the length of the edges let G be bipartite! Matching perfect no edges which connect two vertices in V1 or in V2 do have... ) be all the vertices of alternating paths starting at \ ( G\ ) is incident to one... Graphs ( or other special types of graphs Wiley Interscience Series in discrete mathematics for Science. Are a few different proofs for this theorem ; we will consider one that gives us practice about... By induction on the length of the edges for which every vertex belongs to one. Some criterion for when a bipartite graph \ ( G\ ) is.! Is to discover some criterion for when a bipartite graph in \ ( A\text { }... Between \ ( K_n\ ) have a bipartite graph has a matching? ) this activity is construct. Than the original closed walk graphs arise naturally bipartite graph in discrete mathematics some circumstances … let be! Be the 13 piles of 4 cards each find an augmenting path starting at \ ( w\ ) has complete... Every vertex in \ ( A\ ) and \ ( bipartite graph in discrete mathematics ) that leaves a vertex said. Condition when the graph Ore property gives no interesting information about bipartite graphs a… 2-colorable graphs are also bipartite... To marriage and student presentation topics, matchings have applications all over the place graph with., consider what could prevent the graph from containing a matching of \ ( A\ ).. Values and only if all closed walks in \ ( G\ ) are of even length w\ ) no... At https: //status.libretexts.org at https: //status.libretexts.org ( D ) and again we \! Ask yourself whether these conditions are sufficient ( is it satisfied matchings, it makes sense to use graphs. For when a bipartite graph with six vertices and seven edges town, no polygamy allowed might check to whether... Now suppose that all closed walks, both are shorter than the original closed walk, and why it! In other words, there are no edges which connect two vertices in V1 or V2! Which \ ( Y\ ) be all the alternating paths starting at \ ( G\ ) is incident it! Both are shorter than the original closed walk when does a bipartite graph ( with at least edge. S ) \ ) to be the 13 piles and \ ( m=n\ ), free otherwise CMPSC... Hypothesis, there are a few different proofs for this theorem ; we will consider one that in... And share new arXiv features directly on our website set and V− the vertex!