关于所有分式[a,b]-因子的简化存在定理
Simplified existence theorems on all fractional [a,b]-factors
摘要:
设$G$是一个图,序为$n$,设$g, f : V (G)\rightarrow N$使得对所有$v\in V(G)$有$g(v)\leq f(v)$.如果$G$对每个$p: V (G)\rightarrow N$都有一个分数$p$-因子,使得对每个$v\in V(G)$都有$g(v)\leq p(v)\leq f (v)$,则我们说$G$有所有分数$(g, f)$ -因子。令$a<b$为两个正整数。%和$n$阶的$G$ \textbf{a graph}对于$a$和$b$来说足够大的%。如果$g\equiv a$、$f\equiv b$和$G$具有全部分数$(g,f)$ -因子,则我们说$G$具有全部分数$[a,b]$ -因子。假设$n$对于$a$和$b$来说足够大。本文给出了关于图的所有$(g,f)$ -因子存在性的两个结果。首先,我们从Anstee的分数$(g,f)$ -因子定理导出了所有分数$(g,f)$ -因子性质的一个类似刻画。其次,我们证明了$G$具有所有的分数$[a, b]$ -因子,如果最小度至少是$\frac{1}{4a}((a+b-1)^2+4b)$,并且每对不相邻的顶点具有至少$bn/(a + b)$的邻域并的基数。这些下界是很尖锐的。
英文摘要:
Let $G$ be a graph with order $n$ and let $g, f : V (G)\rightarrow N$ such that $g(v)\leq f(v)$ for all $v\in V(G)$. We say that $G$ has all fractional $(g, f)$-factors if $G$ has a fractional $p$-factor for every $p: V (G)\rightarrow N$ such that $g(v)\leq p(v)\leq f (v)$ for every $v\in V(G)$. Let $a<b$ be two positive integers. %and $G$ \textbf{a graph} of order $n$ sufficiently large %for $a$ and $b$. If $g\equiv a$, $f\equiv b$ and $G$ has all fractional $(g,f)$-factors, then we say that $G$ has all fractional $[a,b]$-factors. Suppose that $n$ is sufficiently large for $a$ and $b$. This paper contains two results on the existence of all $(g,f)$-factors of graphs. First, we derive from Anstee's fractional $(g,f)$-factor theorem a similar characterization for the property of all fractional $(g,f)$-factors. Second, we show that $G$ has all fractional $[a, b]$-factors if the minimum degree is at least $\frac{1}{4a}((a+b-1)^2+4b)$ and every pair of nonadjacent vertices has cardinality of the neighborhood union at least $bn/(a + b)$. These lower bounds are sharp.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。