Sign inSign in
ConceptMathematics

Bipartite graph

A graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to one in the other.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Edge2Graph2Graph theory2Vertex1Vertices1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Tom Leighton

    MIT · Undergraduate

    A graph is bipartite if its vertices can be split into a left set and a right set such that all edges connect a node in the left set to a node in the right set.
  • Gilbert Strang

    MIT · Undergraduate

    A graph whose nodes can be divided into two disjoint sets such that every edge connects a node in one set to a node in the other.
    • 12:02Completing a Rank-One Matrix and Circulants
  • Soumyajit Saha

    University of Strasbourg (IRMA) · Graduate

    A graph whose vertices can be divided into two disjoint and independent sets such that every edge connects a vertex in one set to a vertex in the other.
    • 17:46Nodal Geometry and Perturbations of the Laplace-Beltrami Operator

Lectures that assume it

11

Connections

23

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.