What?
A graph, where you can split the nodes (vertices) into two disjoint sets. Each node is only connected to nodes of the opposite set.
Example - Job fair at Uni:
Imagine a job fair. You can’t match Google to Microsoft, but you can match Google to Student A, B and C. Student E can match to Google, Microsoft and SkyScanner.
