更改

在射影几何中，'''<font color="#ff8000"> Levi图</font>'''是二分图的一种形式，用于对配置点和线之间的入射进行建模。对应于点和线的几何特性，即每两条线最多相交一个点，并且每两个点都由一条线连接，因此Levi图不一定包含任何长度为4的环，进而其周长必须为6或更大。

在射影几何中，'''<font color="#ff8000"> Levi图</font>'''是二分图的一种形式，用于对配置点和线之间的入射进行建模。对应于点和线的几何特性，即每两条线最多相交一个点，并且每两个点都由一条线连接，因此Levi图不一定包含任何长度为4的环，进而其周长必须为6或更大。

== See also 其他参考资料 ==

== See also 另请参见 ==

*[[Bipartite dimension]], the minimum number of complete bipartite graphs whose union is the given graph

*[[Bipartite dimension]], the minimum number of complete bipartite graphs whose union is the given graph

*[[Bipartite double cover]], a way of transforming any graph into a bipartite graph by doubling its vertices

*[[Bipartite double cover]], a way of transforming any graph into a bipartite graph by doubling its vertices

* 二分双重覆盖，一种将任意图转变为二分图的方法。通过双重复制顶点使原图形成两个不相交的副本。

* 二分双重覆盖，一种通过双重复制顶点使原图形成两个不相交的副本从而将任意图转变为二分图的方法。

*[[Bipartite hypergraph]], a generalization of bipartiteness to [[hypergraph]]s.

*[[Bipartite hypergraph]], a generalization of bipartiteness to [[hypergraph]]s.

*[[Bipartite matroid]], a class of matroids that includes the [[graphic matroid]]s of bipartite graphs

*[[Bipartite matroid]], a class of matroids that includes the [[graphic matroid]]s of bipartite graphs

* 二部拟阵，属于拟阵的一类，包括二分图的图形拟阵

* 二部拟阵，包括二分图的图形拟阵，属于拟阵的一类。

*[[Bipartite network projection]], a weighting technique for compressing information about bipartite networks

*[[Bipartite network projection]], a weighting technique for compressing information about bipartite networks

*[[Multipartite graph]], a generalization of bipartite graphs to more than two subsets of vertices

*[[Multipartite graph]], a generalization of bipartite graphs to more than two subsets of vertices

* 多重图，将二分图进行延申到两个以上的顶点子集。

* 多重图，将二分图延伸到两个以上的顶点子集。

*[[Parity graph]], a generalization of bipartite graphs in which every two [[induced path]]s between the same two points have the same parity

*[[Parity graph]], a generalization of bipartite graphs in which every two [[induced path]]s between the same two points have the same parity

*[[Quasi-bipartite graph]], a type of Steiner tree problem instance in which the terminals form an independent set, allowing approximation algorithms that generalize those for bipartite graphs

*[[Quasi-bipartite graph]], a type of Steiner tree problem instance in which the terminals form an independent set, allowing approximation algorithms that generalize those for bipartite graphs

* 准二分图，一种斯坦纳树Steiner tree问题实例，其中的终端形成一个独立的集合，从而允许近似算法将二分图的规范化

* 准二分图，一种斯坦纳树形Steiner tree问题实例，其中的终端形成一个独立的集合，从而允许近似算法将二分图的规范化

*[[Split graph]], a graph in which the vertices can be partitioned into two subsets, one of which is independent and the other of which is a clique

*[[Split graph]], a graph in which the vertices can be partitioned into two subsets, one of which is independent and the other of which is a clique

*[[Zarankiewicz problem]] on the maximum number of edges in a bipartite graph with forbidden subgraphs

*[[Zarankiewicz problem]] on the maximum number of edges in a bipartite graph with forbidden subgraphs

* Zarankiewicz 问题，关于禁止子图二分图的最大边数问题。

* Zarankiewicz 问题，关于子图二分图的最大边数限制问题。

== References 参考文献==

== References 参考文献==