k-联性是图的一个重要的连通性质.Kawarabwyshi证明了对每一个k≠4,5,围长至少为11的2k-连通图是k-联的.主要证明:当k≥46时,每一个偶围长至少为8的2k-连通图是k-联图.
Linkage is one of the most important properties in graph theory, Kawarabwyshi proved that for k≠4,5 every 2k-connected graph with girth at least 11 was k-linked. It showed that for each integer k≥46, with even girth at least 8, every 2k-connected graph is k-linked.