\(\DeclarePairedDelimiterX{\Set}[2]{\{}{\}}{#1 \nonscript\;\delimsize\vert\nonscript\; #2}\) \( \DeclarePairedDelimiter{\set}{\{}{\}}\) \( \DeclarePairedDelimiter{\parens}{\left(}{\right)}\) \(\DeclarePairedDelimiterX{\innerproduct}[1]{\langle}{\rangle}{#1}\) \(\newcommand{\ip}[1]{\innerproduct{#1}}\) \(\newcommand{\bmat}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\barray}[1]{\left[\hspace{2.0pt}\begin{matrix}#1\end{matrix}\hspace{2.0pt}\right]}\) \(\newcommand{\mat}[1]{\begin{matrix}#1\end{matrix}}\) \(\newcommand{\pmat}[1]{\begin{pmatrix}#1\end{pmatrix}}\) \(\newcommand{\mathword}[1]{\mathop{\textup{#1}}}\)
Needs:
Undirected Graphs ›
Needed by:
None.
Links:
Sheet PDF ›
Graph PDF ›
Wikipedia ›

Bipartite Graphs

Definition

An undirected graph $(V, E)$ is bipartite (a bipartite graph) if there is a partition $\set{A, B}$ of $V$ so no two vertices in $A$ are adjacent and no two vertices in $B$ are adjacent.

A bipartite graph has no odd cycles.
 Copyright © 2023 The Bourbaki Authors — All rights reserved — Version 13a6779cc — About — Show the old page view