论文标题
立方图的同构二聚体
Isomorphic Bisections of Cubic Graphs
论文作者
论文摘要
根据某些条件，图形分配或将图表分为两个或多个部分，自然会在整个离散数学过程中自然而然地出现，并且此类问题已经进行了广泛的研究。在1990年代，安多（Ando）猜想每个立方图的顶点可以分为诱导同构亚图的两个部分。使用概率方法以及精致的重新陈述参数，我们证明了安多（Ando）对大型连接图的猜想。
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured that the vertices of every cubic graph can be partitioned into two parts that induce isomorphic subgraphs. Using probabilistic methods together with delicate recolouring arguments, we prove Ando's conjecture for large connected graphs.
