同时最大化多个切割
Maximizing several cuts simultaneously
摘要:
考虑同一顶点集V上的两个图G_1和G_2,设G_i有m_i条边.则存在V的二分划,使得对i= 1,2,G_i中A与B之间的边数为(1+o(1))m_i/2.这回答了Bollobas和Scott的一个问题。我们还证明了结果分区成两个以上的顶点类。
英文摘要:
Consider two graphs G_1 and G_2 on the same vertex set V and suppose that G_i has m_i edges. Then there is a bipartition of V into two classes A and B so that for both i=1,2 the number of edges between A and B in G_i is (1+o(1))m_i/2. This answers a question of Bollobas and Scott. We also prove results about partitions into more than two vertex classes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。