关于偶图中过给定边集的圈

On Circuits Including a Given Set of Independent Edges in Abipartite

设G＝（A，B；E）是偶图，|A|＝|B|＝n≥2，M是任意一个独立边的集合，|M|≥2，如果对于E中的任意两条边e，f（e≠f），有d（e）＋d（f）≥4n－|M|＋1，则G中存在一个含有M的圈．

The, main result in this parper is as followa:Let C= (A, B; E) be abipartite graph with 2n vertices, |A| =|B| =n≥2, if ■ e1, e2∈E, e1≠e2, dG (e1 )+dG (e2)≥4n-|M| + 1, then there exists a cricuit including M, where M is a set of independent edges.