arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.01729math.CO
收藏

关于阿贝尔群的卡莱伊图的分数匹配可扩展性

On the fractional matching extendability of Cayley graphs of Abelian groups

University of Ljubljana, Faculty of Education(卢布尔雅那大学教育学院);University of Primorska, Institute Andrej Marušič(沿海大学安德烈·马鲁西奇研究所);Institute of Mathematics, Physics and Mechanics(数学、物理与力学研究所)

Boštjan Kuzman, Primož Šparl

AI总结:

本文研究了阿贝尔群卡莱伊图的分数匹配可扩展性,证明除了奇数环外所有连通图都是分数1-可扩展,并对分数2-可扩展图进行了分类。

摘要:

分数匹配可扩展性是一个将图论中两个广泛研究的主题结合起来的概念,即分数匹配和匹配可扩展性。一个图Γ的分数匹配是指一个从边集E到实数区间[0,1]的函数f,其性质是对于每个顶点v,所有与v相邻的边的f值之和不超过1。当这个和等于1时,分数匹配是完美的。阶数至少为2t+1的图是分数t-可扩展的,如果它包含大小为t的匹配,并且每个这样的匹配M都可以扩展为一个分数完美匹配,即对应的函数f将每条M中的边赋值为1。在本文中,我们研究了阿贝尔群的卡莱伊图的分数匹配可扩展性。我们证明,除了奇数环外,所有连通的阿贝尔群卡莱伊图都是分数1-可扩展的,并且对阿贝尔群的分数2-可扩展的卡莱伊图进行了分类。这扩展了1995年Chan、Chen和Yu对偶数阶连通阿贝尔群卡莱伊图2-可扩展性(在经典意义上)的分类。

英文摘要:

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $Γ$ with edge set $E$ is a function $f$ from $E$ to the real interval $[0,1]$ with the property that for each vertex $v$ of $Γ$, the sum of $f$-values of all the edges incident to $v$ is at most $1$. When this sum equals $1$ for each vertex $v$, the fractional matching is {\em perfect}. A graph of order at least $2t+1$ is {\em fractional $t$-extendable} if it contains a matching of size $t$ and if each such matching $M$ can be extended to a fractional perfect matching in the sense that the corresponding function $f$ assigns value $1$ to each edge of $M$. In this paper, we study fractional matching extendability of Cayley graphs of Abelian groups. We show that, except for the odd cycles, all connected Cayley graphs of Abelian groups are fractional $1$-extendable and we classify the fractional $2$-extendable Cayley graphs of Abelian groups. This extends the classification of $2$-extendable (in the classical sense) connected Cayley graphs of Abelian groups of even order from 1995, obtained by Chan, Chen and Yu.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑