更改

A [[complete bipartite graph with m = 5 and n = 3]]

A [[complete bipartite graph with m = 5 and n = 3]]

A [[ m = 5和 n = 3的完全二分图]

节点数分别为m=5和n=3的两个集合所组成的一个完整二分图

In the [[mathematics|mathematical]] field of [[graph theory]], a '''bipartite graph''' (or '''bigraph''') is a [[Graph (discrete mathematics)|graph]] whose [[vertex (graph theory)|vertices]] can be divided into two [[disjoint sets|disjoint]] and [[Independent set (graph theory)|independent sets]] <math>U</math> and <math>V</math> such that every [[edge (graph theory)|edge]] connects a vertex in <math>U</math> to one in <math>V</math>. Vertex sets <math>U</math> and <math>V</math> are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length [[cycle (graph theory)|cycles]].<ref name=diestel2005graph>{{cite book|last=Diestel|first=Reinard|title=Graph Theory, Grad. Texts in Math|year=2005|publisher=Springer|isbn=978-3-642-14278-9|url=http://diestel-graph-theory.com/}}</ref><ref>{{citation

In the [[mathematics|mathematical]] field of [[graph theory]], a '''bipartite graph''' (or '''bigraph''') is a [[Graph (discrete mathematics)|graph]] whose [[vertex (graph theory)|vertices]] can be divided into two [[disjoint sets|disjoint]] and [[Independent set (graph theory)|independent sets]] <math>U</math> and <math>V</math> such that every [[edge (graph theory)|edge]] connects a vertex in <math>U</math> to one in <math>V</math>. Vertex sets <math>U</math> and <math>V</math> are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length [[cycle (graph theory)|cycles]].<ref name=diestel2005graph>{{cite book|last=Diestel|first=Reinard|title=Graph Theory, Grad. Texts in Math|year=2005|publisher=Springer|isbn=978-3-642-14278-9|url=http://diestel-graph-theory.com/}}</ref><ref>{{citation